/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 ..................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 14:17:59,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:17:59,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:17:59,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:17:59,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:17:59,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:17:59,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:17:59,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:17:59,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:17:59,674 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:17:59,676 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:17:59,676 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:17:59,677 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:17:59,678 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:17:59,680 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:17:59,680 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:17:59,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:17:59,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:17:59,686 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:17:59,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:17:59,689 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:17:59,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:17:59,694 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:17:59,694 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:17:59,695 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:17:59,696 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:17:59,697 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:17:59,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:17:59,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:17:59,700 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:17:59,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:17:59,701 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:17:59,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:17:59,702 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:17:59,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:17:59,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:17:59,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 14:17:59,721 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:17:59,721 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:17:59,723 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:17:59,723 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:17:59,724 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:17:59,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:17:59,724 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:17:59,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:17:59,724 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:17:59,725 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 14:17:59,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:17:59,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:17:59,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:17:59,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:17:59,727 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:17:59,727 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:17:59,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:17:59,727 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:17:59,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:17:59,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:17:59,728 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:17:59,728 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:17:59,728 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:17:59,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:17:59,730 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:17:59,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:17:59,730 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 14:17:59,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:17:59,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 14:17:59,731 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-09-20 14:17:59,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:17:59,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:17:59,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:17:59,804 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:17:59,804 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:17:59,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-09-20 14:18:00,150 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce219b1c/d4b3a6229377493a9e9c0068ae989797/FLAGea5a299cb [2018-09-20 14:18:00,414 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:18:00,415 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-09-20 14:18:00,423 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce219b1c/d4b3a6229377493a9e9c0068ae989797/FLAGea5a299cb [2018-09-20 14:18:00,439 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fce219b1c/d4b3a6229377493a9e9c0068ae989797 [2018-09-20 14:18:00,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:18:00,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:18:00,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:18:00,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:18:00,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:18:00,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a72ee37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00, skipping insertion in model container [2018-09-20 14:18:00,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,475 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:18:00,697 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:18:00,717 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:18:00,728 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:18:00,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00 WrapperNode [2018-09-20 14:18:00,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:18:00,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:18:00,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:18:00,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:18:00,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,772 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... [2018-09-20 14:18:00,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:18:00,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:18:00,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:18:00,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:18:00,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:18:00,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:18:00,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:18:00,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 14:18:00,846 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-20 14:18:00,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:18:00,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:18:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:18:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-20 14:18:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 14:18:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-20 14:18:00,847 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:18:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:18:00,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:18:01,337 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:18:01,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:18:01 BoogieIcfgContainer [2018-09-20 14:18:01,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:18:01,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:18:01,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:18:01,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:18:01,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:18:00" (1/3) ... [2018-09-20 14:18:01,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7c09c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:18:01, skipping insertion in model container [2018-09-20 14:18:01,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:00" (2/3) ... [2018-09-20 14:18:01,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7c09c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:18:01, skipping insertion in model container [2018-09-20 14:18:01,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:18:01" (3/3) ... [2018-09-20 14:18:01,348 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-09-20 14:18:01,359 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:18:01,369 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:18:01,423 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:18:01,424 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:18:01,425 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:18:01,425 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:18:01,425 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:18:01,425 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:18:01,425 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:18:01,425 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:18:01,426 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:18:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-20 14:18:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-20 14:18:01,455 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:18:01,457 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:18:01,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:18:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-20 14:18:01,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:18:01,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:18:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:18:01,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:18:01,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:18:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:18:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:18:01,638 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:18:01,638 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:18:01,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:18:01,656 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:18:01,657 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:18:01,660 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-20 14:18:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:18:01,684 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-20 14:18:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:18:01,686 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-20 14:18:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:18:01,696 INFO L225 Difference]: With dead ends: 56 [2018-09-20 14:18:01,696 INFO L226 Difference]: Without dead ends: 26 [2018-09-20 14:18:01,700 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:18:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-20 14:18:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-20 14:18:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-20 14:18:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-20 14:18:01,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-20 14:18:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:18:01,747 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-20 14:18:01,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:18:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-20 14:18:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:18:01,748 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:18:01,748 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:18:01,750 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:18:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-20 14:18:01,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 14:18:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 14:18:01,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:18:01,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:18:01,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 14:18:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:18:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 14:18:01,807 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 14:18:01,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 02:18:01 BoogieIcfgContainer [2018-09-20 14:18:01,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 14:18:01,857 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 14:18:01,857 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 14:18:01,857 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 14:18:01,858 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:18:01" (3/4) ... [2018-09-20 14:18:01,862 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 14:18:01,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 14:18:01,864 INFO L168 Benchmark]: Toolchain (without parser) took 1419.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 951.9 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:18:01,866 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:18:01,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:18:01,868 INFO L168 Benchmark]: Boogie Preprocessor took 38.79 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:18:01,869 INFO L168 Benchmark]: RCFGBuilder took 555.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:18:01,870 INFO L168 Benchmark]: TraceAbstraction took 516.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:18:01,871 INFO L168 Benchmark]: Witness Printer took 6.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:18:01,875 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.79 ms. Allocated memory is still 1.0 GB. Free memory is still 941.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 555.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 941.1 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 516.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 15]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L17] double _EPS = 1e-6; VAL [\old(_EPS)=2, _EPS=1/1000000] [L44] double d, r; [L46] d = 1. VAL [_EPS=1/1000000, d=1] [L46] COND TRUE d <= 20. VAL [_EPS=1/1000000, d=1] [L48] CALL, EXPR SqrtR(d) VAL [\old(Input)=1, _EPS=1/1000000] [L21] double xn, xnp1, residu, lsup, linf; [L22] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L23] COND TRUE Input <= 1.0 [L23] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L24] xnp1 = xn [L25] residu = 2.0*_EPS*(xn+xnp1) [L26] lsup = _EPS * (xn+xnp1) [L27] linf = -lsup [L28] cond = ((residu > lsup) || (residu < linf)) [L29] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L30] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L39] RET return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L48] EXPR SqrtR(d) VAL [_EPS=1/1000000, d=1, SqrtR(d)=3] [L48] r = SqrtR(d) [L50] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) VAL [\old(cond)=0, _EPS=1/1000000] [L15] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L15] __VERIFIER_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 14:18:04,378 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 14:18:04,380 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 14:18:04,399 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 14:18:04,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 14:18:04,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 14:18:04,402 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 14:18:04,404 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 14:18:04,406 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 14:18:04,407 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 14:18:04,408 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 14:18:04,408 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 14:18:04,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 14:18:04,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 14:18:04,412 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 14:18:04,413 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 14:18:04,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 14:18:04,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 14:18:04,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 14:18:04,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 14:18:04,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 14:18:04,424 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 14:18:04,427 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 14:18:04,427 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 14:18:04,427 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 14:18:04,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 14:18:04,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 14:18:04,433 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 14:18:04,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 14:18:04,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 14:18:04,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 14:18:04,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 14:18:04,438 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 14:18:04,438 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 14:18:04,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 14:18:04,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 14:18:04,446 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 14:18:04,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 14:18:04,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 14:18:04,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 14:18:04,483 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 14:18:04,484 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 14:18:04,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 14:18:04,484 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 14:18:04,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 14:18:04,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 14:18:04,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 14:18:04,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 14:18:04,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 14:18:04,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 14:18:04,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 14:18:04,486 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 14:18:04,486 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 14:18:04,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 14:18:04,489 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 14:18:04,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 14:18:04,490 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 14:18:04,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 14:18:04,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 14:18:04,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 14:18:04,491 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:18:04,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 14:18:04,492 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 14:18:04,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 14:18:04,492 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 14:18:04,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 14:18:04,493 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 14:18:04,493 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 14:18:04,493 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71391a154c08c1da1cb11d5d7900dd0d1303e4a1 [2018-09-20 14:18:04,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 14:18:04,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 14:18:04,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 14:18:04,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 14:18:04,579 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 14:18:04,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-09-20 14:18:04,941 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981fd3b7d/9fe084f1386447e8a8397abc46e34542/FLAG776d94271 [2018-09-20 14:18:05,087 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 14:18:05,088 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Householder_constant_true-unreach-call.c [2018-09-20 14:18:05,097 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981fd3b7d/9fe084f1386447e8a8397abc46e34542/FLAG776d94271 [2018-09-20 14:18:05,115 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981fd3b7d/9fe084f1386447e8a8397abc46e34542 [2018-09-20 14:18:05,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 14:18:05,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 14:18:05,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 14:18:05,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 14:18:05,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 14:18:05,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbd79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05, skipping insertion in model container [2018-09-20 14:18:05,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,155 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 14:18:05,415 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:18:05,445 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 14:18:05,474 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 14:18:05,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05 WrapperNode [2018-09-20 14:18:05,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 14:18:05,507 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 14:18:05,507 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 14:18:05,507 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 14:18:05,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... [2018-09-20 14:18:05,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 14:18:05,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 14:18:05,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 14:18:05,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 14:18:05,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 14:18:05,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 14:18:05,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 14:18:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-20 14:18:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure SqrtR [2018-09-20 14:18:05,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 14:18:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 14:18:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 14:18:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-09-20 14:18:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-20 14:18:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure SqrtR [2018-09-20 14:18:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 14:18:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 14:18:05,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 14:18:15,384 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 14:18:15,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:18:15 BoogieIcfgContainer [2018-09-20 14:18:15,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 14:18:15,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 14:18:15,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 14:18:15,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 14:18:15,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 02:18:05" (1/3) ... [2018-09-20 14:18:15,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d3a678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:18:15, skipping insertion in model container [2018-09-20 14:18:15,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 02:18:05" (2/3) ... [2018-09-20 14:18:15,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d3a678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 02:18:15, skipping insertion in model container [2018-09-20 14:18:15,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 02:18:15" (3/3) ... [2018-09-20 14:18:15,395 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant_true-unreach-call.c [2018-09-20 14:18:15,407 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 14:18:15,415 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 14:18:15,458 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 14:18:15,459 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 14:18:15,459 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 14:18:15,459 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 14:18:15,459 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 14:18:15,459 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 14:18:15,459 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 14:18:15,460 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 14:18:15,460 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 14:18:15,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-09-20 14:18:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-20 14:18:15,488 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:18:15,489 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:18:15,492 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:18:15,498 INFO L82 PathProgramCache]: Analyzing trace with hash 924932034, now seen corresponding path program 1 times [2018-09-20 14:18:15,504 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:18:15,504 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 14:18:15,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:18:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:18:17,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:18:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:18:17,133 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:18:17,164 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:18:17,165 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 14:18:17,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 14:18:17,183 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 14:18:17,184 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:18:17,187 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-09-20 14:18:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:18:17,213 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-09-20 14:18:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 14:18:17,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-09-20 14:18:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:18:17,224 INFO L225 Difference]: With dead ends: 56 [2018-09-20 14:18:17,224 INFO L226 Difference]: Without dead ends: 26 [2018-09-20 14:18:17,228 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 14:18:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-20 14:18:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-20 14:18:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-20 14:18:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-09-20 14:18:17,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2018-09-20 14:18:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:18:17,272 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-09-20 14:18:17,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 14:18:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-09-20 14:18:17,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:18:17,274 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:18:17,274 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:18:17,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:18:17,275 INFO L82 PathProgramCache]: Analyzing trace with hash 244023785, now seen corresponding path program 1 times [2018-09-20 14:18:17,276 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:18:17,276 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 14:18:17,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:18:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:18:18,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:18:33,256 WARN L178 SmtUtils]: Spent 11.14 s on a formula simplification. DAG size of input: 31 DAG size of output: 9 [2018-09-20 14:18:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:18:33,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:18:33,303 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:18:33,303 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 14:18:33,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 14:18:33,305 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 14:18:33,306 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:18:33,306 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2018-09-20 14:18:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:18:41,699 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-09-20 14:18:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 14:18:41,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-20 14:18:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:18:41,703 INFO L225 Difference]: With dead ends: 49 [2018-09-20 14:18:41,703 INFO L226 Difference]: Without dead ends: 29 [2018-09-20 14:18:41,704 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:18:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-20 14:18:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-20 14:18:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-20 14:18:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-09-20 14:18:41,713 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-09-20 14:18:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:18:41,714 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-09-20 14:18:41,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 14:18:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-09-20 14:18:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-20 14:18:41,716 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:18:41,716 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:18:41,716 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:18:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash 502189223, now seen corresponding path program 1 times [2018-09-20 14:18:41,717 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:18:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 14:18:41,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:18:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:18:44,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:18:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 14:18:44,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:18:44,296 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:18:44,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 14:18:44,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 14:18:44,297 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 14:18:44,297 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:18:44,298 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2018-09-20 14:18:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:18:51,369 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-09-20 14:18:51,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 14:18:51,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-09-20 14:18:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:18:51,376 INFO L225 Difference]: With dead ends: 63 [2018-09-20 14:18:51,377 INFO L226 Difference]: Without dead ends: 40 [2018-09-20 14:18:51,378 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 14:18:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-20 14:18:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-09-20 14:18:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-20 14:18:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-09-20 14:18:51,397 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 22 [2018-09-20 14:18:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:18:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-09-20 14:18:51,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 14:18:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-09-20 14:18:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-20 14:18:51,400 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:18:51,401 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:18:51,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:18:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1812175119, now seen corresponding path program 1 times [2018-09-20 14:18:51,402 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:18:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-20 14:18:51,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 14:18:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:18:55,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:18:57,987 WARN L797 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from false [2018-09-20 14:19:00,165 WARN L819 $PredicateComparison]: unable to prove that (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xnp1~0) is different from true [2018-09-20 14:19:02,744 WARN L797 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from false [2018-09-20 14:19:05,309 WARN L819 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) is different from true [2018-09-20 14:19:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-20 14:19:05,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:19:30,001 WARN L178 SmtUtils]: Spent 23.97 s on a formula simplification that was a NOOP. DAG size: 33 [2018-09-20 14:19:48,328 WARN L178 SmtUtils]: Spent 18.33 s on a formula simplification that was a NOOP. DAG size: 31 [2018-09-20 14:20:14,253 WARN L178 SmtUtils]: Spent 25.92 s on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 14:20:40,236 WARN L178 SmtUtils]: Spent 25.98 s on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 14:20:42,798 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2018-09-20 14:20:45,373 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse1) .cse1) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) RNE 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2018-09-20 14:20:47,988 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from false [2018-09-20 14:20:50,624 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))) is different from true [2018-09-20 14:20:53,643 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from false [2018-09-20 14:20:56,683 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0)))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 c_SqrtR_~xnp1~0))) (and (fp.leq .cse3 .cse1) (fp.geq .cse3 .cse2)))))) is different from true [2018-09-20 14:21:00,405 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from false [2018-09-20 14:21:03,908 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse1 ((_ to_fp 11 53) RNE 1.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) is different from true [2018-09-20 14:21:07,035 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from false [2018-09-20 14:21:10,206 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1)))))) is different from true [2018-09-20 14:21:12,829 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse2 (fp.div RNE .cse3 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0))))) (let ((.cse1 (fp.geq .cse2 .cse3)) (.cse0 (fp.leq .cse2 ((_ to_fp 11 53) RNE 5.0)))) (or (not .cse0) (not .cse1) (and .cse1 .cse0))))) is different from false [2018-09-20 14:21:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-20 14:21:12,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-20 14:21:12,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-09-20 14:21:12,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-20 14:21:12,920 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-20 14:21:12,921 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=128, Unknown=14, NotChecked=196, Total=380 [2018-09-20 14:21:12,921 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 20 states. [2018-09-20 14:21:15,524 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse1 (fp.div RNE .cse0 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_main_~d~0 .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_main_~d~0) .cse0) .cse0))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= .cse0 c_main_~d~0) (fp.leq .cse1 ((_ to_fp 11 53) RNE 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2018-09-20 14:21:18,164 WARN L797 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from false [2018-09-20 14:21:21,320 WARN L819 $PredicateComparison]: unable to prove that (and (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (let ((.cse4 ((_ to_fp 11 53) RNE 15.0)) (.cse5 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse6 ((_ to_fp 11 53) RNE 3.0)) (.cse2 ((_ to_fp 11 53) RNE 1.0)) (.cse7 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 |c_SqrtR_#in~Input|) .cse2) .cse2))))) .cse7))) (.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (let ((.cse3 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse2) .cse2) (fp.add RNE .cse5 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse6 c_SqrtR_~Input) .cse2) .cse2))))) .cse7)))) (and (fp.geq .cse3 .cse2) (fp.leq .cse3 .cse1))))))) is different from true [2018-09-20 14:21:23,901 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from false [2018-09-20 14:21:27,457 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) RNE 1.0))) (and (let ((.cse3 ((_ to_fp 11 53) RNE 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse5 ((_ to_fp 11 53) RNE 3.0)) (.cse6 ((_ to_fp 11 53) RNE 8.0))) (let ((.cse2 ((_ to_fp 11 53) RNE 5.0)) (.cse7 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE .cse1 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 |c_SqrtR_#in~Input|) .cse1) .cse1))))) .cse6)))) (or (let ((.cse0 (fp.div RNE .cse1 (fp.div RNE (fp.mul RNE c_SqrtR_~xn~0 (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input c_SqrtR_~xn~0) c_SqrtR_~xn~0) (fp.add RNE .cse4 (fp.mul RNE (fp.mul RNE (fp.mul RNE .cse5 c_SqrtR_~Input) c_SqrtR_~xn~0) c_SqrtR_~xn~0))))) .cse6)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq .cse7 .cse2)) (not (fp.geq .cse7 .cse1))))) (= |c_SqrtR_#in~Input| c_SqrtR_~Input) (= .cse1 c_SqrtR_~xn~0))) is different from true [2018-09-20 14:21:30,048 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from false [2018-09-20 14:21:33,113 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE (fp.mul RNE .cse3 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse3) .cse3) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse3) .cse3))))) ((_ to_fp 11 53) RNE 8.0)))) (and (= .cse0 c_SqrtR_~xnp1~0) (let ((.cse1 (fp.div RNE .cse3 .cse0)) (.cse2 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse3)) (let ((.cse4 (fp.div RNE .cse3 c_SqrtR_~xnp1~0))) (and (fp.leq .cse4 .cse2) (fp.geq .cse4 .cse3)))))))) is different from true [2018-09-20 14:21:38,921 WARN L797 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from false [2018-09-20 14:21:41,509 WARN L819 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) RNE 1.0))) (let ((.cse0 (fp.div RNE .cse2 (fp.div RNE (fp.mul RNE .cse2 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse2) .cse2) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|) .cse2) .cse2))))) ((_ to_fp 11 53) RNE 8.0))))) (and (= |c_SqrtR_#res| .cse0) (let ((.cse1 ((_ to_fp 11 53) RNE 5.0))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (and (fp.leq |c_SqrtR_#res| .cse1) (fp.geq |c_SqrtR_#res| .cse2))))))) is different from true [2018-09-20 14:21:41,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:21:41,944 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-09-20 14:21:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 14:21:41,949 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 24 [2018-09-20 14:21:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:21:41,951 INFO L225 Difference]: With dead ends: 55 [2018-09-20 14:21:41,951 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 14:21:41,955 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=58, Invalid=149, Unknown=23, NotChecked=420, Total=650 [2018-09-20 14:21:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 14:21:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2018-09-20 14:21:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 14:21:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-09-20 14:21:41,972 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-09-20 14:21:41,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:21:41,973 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-09-20 14:21:41,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-20 14:21:41,973 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-09-20 14:21:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-20 14:21:41,974 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:21:41,976 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:21:41,976 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:21:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 801057869, now seen corresponding path program 1 times [2018-09-20 14:21:41,977 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:21:41,977 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 14:21:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 14:21:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 14:21:47,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:21:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-20 14:21:47,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 14:21:47,247 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 14:21:47,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 14:21:47,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 14:21:47,248 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 14:21:47,248 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 14:21:47,249 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-09-20 14:21:52,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 14:21:52,373 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2018-09-20 14:21:52,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-20 14:21:52,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-09-20 14:21:52,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 14:21:52,376 INFO L225 Difference]: With dead ends: 89 [2018-09-20 14:21:52,376 INFO L226 Difference]: Without dead ends: 56 [2018-09-20 14:21:52,378 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 14:21:52,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-20 14:21:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2018-09-20 14:21:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 14:21:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-09-20 14:21:52,393 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 24 [2018-09-20 14:21:52,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 14:21:52,394 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-09-20 14:21:52,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 14:21:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-09-20 14:21:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-20 14:21:52,396 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 14:21:52,396 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-20 14:21:52,396 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 14:21:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1272086197, now seen corresponding path program 2 times [2018-09-20 14:21:52,397 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 14:21:52,397 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 14:21:52,406 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-20 14:21:58,893 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-20 14:21:58,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-20 14:21:59,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 14:22:01,806 WARN L797 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from false [2018-09-20 14:22:04,068 WARN L819 $PredicateComparison]: unable to prove that (and (= (fp.div RNE (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse0 (fp.add RNE ((_ to_fp 11 53) RNE 15.0) (fp.mul RNE (fp.mul RNE (fp.mul RNE c_SqrtR_~Input .cse0) .cse0) (fp.add RNE (fp.neg ((_ to_fp 11 53) RNE 10.0)) (fp.mul RNE (fp.mul RNE (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) c_SqrtR_~Input) .cse0) .cse0)))))) ((_ to_fp 11 53) RNE 8.0)) c_SqrtR_~xn~0) (= |c_SqrtR_#in~Input| c_SqrtR_~Input)) is different from true [2018-09-20 14:22:06,628 WARN L797 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from false [2018-09-20 14:22:09,174 WARN L819 $PredicateComparison]: unable to prove that (= (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse1 ((_ to_fp 11 53) RNE 15.0)) (.cse2 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse3 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse0 (fp.div RNE (let ((.cse4 ((_ to_fp 11 53) RNE 1.0))) (fp.mul RNE .cse4 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse4) .cse4) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse4) .cse4)))))) .cse5))) (fp.mul RNE .cse0 (fp.add RNE .cse1 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE .cse3 .cse0) .cse0))))))) .cse5)) c_SqrtR_~xnp1~0) is different from true [2018-09-20 14:22:12,147 WARN L797 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from false [2018-09-20 14:22:15,129 WARN L819 $PredicateComparison]: unable to prove that (= |c_SqrtR_#res| (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (fp.div RNE .cse0 (let ((.cse5 ((_ to_fp 11 53) RNE 8.0))) (fp.div RNE (let ((.cse2 ((_ to_fp 11 53) RNE 15.0)) (.cse3 (fp.neg ((_ to_fp 11 53) RNE 10.0))) (.cse4 (fp.mul RNE ((_ to_fp 11 53) RNE 3.0) |c_SqrtR_#in~Input|))) (let ((.cse1 (fp.div RNE (fp.mul RNE .cse0 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse0) .cse0) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse0) .cse0))))) .cse5))) (fp.mul RNE .cse1 (fp.add RNE .cse2 (fp.mul RNE (fp.mul RNE (fp.mul RNE |c_SqrtR_#in~Input| .cse1) .cse1) (fp.add RNE .cse3 (fp.mul RNE (fp.mul RNE .cse4 .cse1) .cse1))))))) .cse5))))) is different from true [2018-09-20 14:22:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-09-20 14:22:15,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 14:22:50,957 WARN L178 SmtUtils]: Spent 35.42 s on a formula simplification that was a NOOP. DAG size: 46 [2018-09-20 14:23:00,607 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-09-20 14:23:00,809 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2018-09-20 14:23:00,810 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:149) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition(TransFormulaUtils.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeSummaryForInterproceduralTrace(IterativePredicateTransformer.java:563) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeProcedureSummary(IterativePredicateTransformer.java:483) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:369) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-09-20 14:23:00,816 INFO L168 Benchmark]: Toolchain (without parser) took 295695.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 951.8 MB in the beginning and 907.7 MB in the end (delta: 44.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 11.5 GB. [2018-09-20 14:23:00,818 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 14:23:00,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 14:23:00,822 INFO L168 Benchmark]: Boogie Preprocessor took 71.56 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 14:23:00,823 INFO L168 Benchmark]: RCFGBuilder took 9806.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:23:00,824 INFO L168 Benchmark]: TraceAbstraction took 285428.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 907.7 MB in the end (delta: 191.2 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. [2018-09-20 14:23:00,833 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.92 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 941.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.56 ms. Allocated memory is still 1.0 GB. Free memory was 941.1 MB in the beginning and 935.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 9806.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 285428.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 907.7 MB in the end (delta: 191.2 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...