./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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 /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.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 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 ................................................................................................................................................................................................................................................... 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 /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.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 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 .................................................................................................................................................................................................................................................................................................................................................................................... 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.24-0ed9222-m [2019-01-12 08:41:35,405 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:41:35,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:41:35,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:41:35,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:41:35,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:41:35,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:41:35,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:41:35,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:41:35,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:41:35,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:41:35,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:41:35,431 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:41:35,432 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:41:35,433 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:41:35,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:41:35,435 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:41:35,437 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:41:35,440 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:41:35,443 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:41:35,444 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:41:35,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:41:35,449 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:41:35,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:41:35,450 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:41:35,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:41:35,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:41:35,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:41:35,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:41:35,457 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:41:35,457 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:41:35,458 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:41:35,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:41:35,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:41:35,461 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:41:35,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:41:35,462 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 08:41:35,480 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:41:35,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:41:35,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:41:35,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:41:35,484 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:41:35,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:41:35,485 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:41:35,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 08:41:35,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:41:35,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:41:35,487 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:41:35,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:41:35,487 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:41:35,487 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:41:35,488 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:41:35,488 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:41:35,488 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:41:35,488 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:41:35,490 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:41:35,490 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:41:35,490 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:41:35,490 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:41:35,491 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:41:35,492 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:41:35,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:41:35,492 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 08:41:35,492 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:41:35,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 08:41:35,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 -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2019-01-12 08:41:35,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:41:35,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:41:35,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:41:35,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:41:35,553 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:41:35,555 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2019-01-12 08:41:35,634 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1eb3d275/2c5660a275d1421ba75df744a7549eef/FLAG2825bd4f1 [2019-01-12 08:41:36,073 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:41:36,074 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2019-01-12 08:41:36,081 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1eb3d275/2c5660a275d1421ba75df744a7549eef/FLAG2825bd4f1 [2019-01-12 08:41:36,451 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1eb3d275/2c5660a275d1421ba75df744a7549eef [2019-01-12 08:41:36,455 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:41:36,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:41:36,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:41:36,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:41:36,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:41:36,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd18d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36, skipping insertion in model container [2019-01-12 08:41:36,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:41:36,496 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:41:36,734 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:41:36,742 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:41:36,775 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:41:36,800 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:41:36,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36 WrapperNode [2019-01-12 08:41:36,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:41:36,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:41:36,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:41:36,802 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:41:36,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:41:36,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:41:36,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:41:36,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:41:36,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (1/1) ... [2019-01-12 08:41:36,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:41:36,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:41:36,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:41:36,899 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:41:36,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (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 [2019-01-12 08:41:37,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:41:37,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:41:37,296 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:41:37,297 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-12 08:41:37,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:41:37 BoogieIcfgContainer [2019-01-12 08:41:37,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:41:37,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:41:37,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:41:37,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:41:37,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:41:36" (1/3) ... [2019-01-12 08:41:37,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b3c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:41:37, skipping insertion in model container [2019-01-12 08:41:37,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:36" (2/3) ... [2019-01-12 08:41:37,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b3c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:41:37, skipping insertion in model container [2019-01-12 08:41:37,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:41:37" (3/3) ... [2019-01-12 08:41:37,307 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2019-01-12 08:41:37,320 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:41:37,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:41:37,346 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:41:37,385 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:41:37,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:41:37,386 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:41:37,388 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:41:37,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:41:37,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:41:37,388 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:41:37,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:41:37,389 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:41:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-12 08:41:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 08:41:37,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:41:37,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:41:37,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:41:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:41:37,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1804134213, now seen corresponding path program 1 times [2019-01-12 08:41:37,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 08:41:37,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 08:41:37,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:41:37,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:41:37,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 08:41:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:41:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 08:41:37,568 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 08:41:37,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 08:41:37 BoogieIcfgContainer [2019-01-12 08:41:37,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 08:41:37,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 08:41:37,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 08:41:37,595 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 08:41:37,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:41:37" (3/4) ... [2019-01-12 08:41:37,599 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 08:41:37,599 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 08:41:37,600 INFO L168 Benchmark]: Toolchain (without parser) took 1144.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:41:37,602 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:41:37,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:41:37,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.34 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:41:37,604 INFO L168 Benchmark]: Boogie Preprocessor took 47.63 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:41:37,605 INFO L168 Benchmark]: RCFGBuilder took 399.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:41:37,606 INFO L168 Benchmark]: TraceAbstraction took 294.18 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 08:41:37,608 INFO L168 Benchmark]: Witness Printer took 4.58 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. [2019-01-12 08:41:37,614 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.48 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 342.51 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.34 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.63 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 294.18 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 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: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of to_real at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L10] static NUM yn = 0; [L12] NUM ui = 0; [L22] NUM yi, yc; [L23] NUM K; [L24] NUM T; [L25] NUM taui; [L26] NUM taud; [L27] NUM ei, sumej, epi; [L28] int i; [L29] T = 1 [L30] taui = 1 [L31] taud = 1 [L32] K = .5 [L33] yc = .5 [L16] yn += ui [L17] return yn; VAL [yn=3] [L34] yi = y(0) [L35] epi = yc-yi [L36] sumej = epi [L37] i=0 VAL [yn=3] [L37] COND TRUE i<120 [L16] yn += ui [L17] return yn; VAL [yn=5] [L38] yi = y(i) [L39] ei = yc-yi [L40] sumej = sumej+ei [L41] ui = K*(ei+sumej*T/taui+taud/T*(ei-epi)) [L42] epi = ei [L6] COND TRUE !(cond) VAL [yn=5] [L6] __VERIFIER_error() VAL [yn=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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.24-0ed9222-m [2019-01-12 08:41:39,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 08:41:39,896 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 08:41:39,913 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 08:41:39,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 08:41:39,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 08:41:39,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 08:41:39,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 08:41:39,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 08:41:39,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 08:41:39,934 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 08:41:39,935 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 08:41:39,936 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 08:41:39,937 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 08:41:39,938 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 08:41:39,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 08:41:39,940 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 08:41:39,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 08:41:39,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 08:41:39,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 08:41:39,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 08:41:39,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 08:41:39,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 08:41:39,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 08:41:39,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 08:41:39,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 08:41:39,954 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 08:41:39,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 08:41:39,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 08:41:39,957 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 08:41:39,957 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 08:41:39,958 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 08:41:39,958 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 08:41:39,958 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 08:41:39,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 08:41:39,960 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 08:41:39,961 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 08:41:39,977 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 08:41:39,978 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 08:41:39,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 08:41:39,980 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 08:41:39,980 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 08:41:39,980 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 08:41:39,981 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 08:41:39,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 08:41:39,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 08:41:39,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 08:41:39,984 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 08:41:39,984 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 08:41:39,984 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 08:41:39,984 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 08:41:39,984 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 08:41:39,985 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 08:41:39,985 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 08:41:39,985 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 08:41:39,985 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 08:41:39,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 08:41:39,985 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 08:41:39,987 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 08:41:39,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 08:41:39,987 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 08:41:39,987 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 08:41:39,987 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 08:41:39,988 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 08:41:39,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 08:41:39,988 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 08:41:39,988 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 08:41:39,988 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 -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2019-01-12 08:41:40,053 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 08:41:40,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 08:41:40,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 08:41:40,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 08:41:40,077 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 08:41:40,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2019-01-12 08:41:40,140 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91d124d9/b999fdf81ffa4682b9a703a88f04b006/FLAG12b1aba4f [2019-01-12 08:41:40,606 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 08:41:40,606 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2019-01-12 08:41:40,613 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91d124d9/b999fdf81ffa4682b9a703a88f04b006/FLAG12b1aba4f [2019-01-12 08:41:40,960 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a91d124d9/b999fdf81ffa4682b9a703a88f04b006 [2019-01-12 08:41:40,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 08:41:40,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 08:41:40,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 08:41:40,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 08:41:40,970 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 08:41:40,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:41:40" (1/1) ... [2019-01-12 08:41:40,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c14b69e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:40, skipping insertion in model container [2019-01-12 08:41:40,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 08:41:40" (1/1) ... [2019-01-12 08:41:40,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 08:41:41,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 08:41:41,185 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:41:41,194 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 08:41:41,217 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 08:41:41,235 INFO L195 MainTranslator]: Completed translation [2019-01-12 08:41:41,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41 WrapperNode [2019-01-12 08:41:41,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 08:41:41,237 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 08:41:41,237 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 08:41:41,237 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 08:41:41,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 08:41:41,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 08:41:41,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 08:41:41,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 08:41:41,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (1/1) ... [2019-01-12 08:41:41,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 08:41:41,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 08:41:41,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 08:41:41,312 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 08:41:41,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (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 [2019-01-12 08:41:41,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 08:41:41,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 08:41:44,833 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 08:41:44,833 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-12 08:41:44,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:41:44 BoogieIcfgContainer [2019-01-12 08:41:44,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 08:41:44,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 08:41:44,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 08:41:44,839 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 08:41:44,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 08:41:40" (1/3) ... [2019-01-12 08:41:44,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3863434c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:41:44, skipping insertion in model container [2019-01-12 08:41:44,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 08:41:41" (2/3) ... [2019-01-12 08:41:44,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3863434c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 08:41:44, skipping insertion in model container [2019-01-12 08:41:44,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 08:41:44" (3/3) ... [2019-01-12 08:41:44,843 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2019-01-12 08:41:44,853 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 08:41:44,862 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 08:41:44,880 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 08:41:44,912 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 08:41:44,912 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 08:41:44,913 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 08:41:44,913 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 08:41:44,913 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 08:41:44,913 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 08:41:44,913 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 08:41:44,914 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 08:41:44,914 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 08:41:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-12 08:41:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 08:41:44,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:41:44,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:41:44,939 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:41:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:41:44,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1804134213, now seen corresponding path program 1 times [2019-01-12 08:41:44,952 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:41:44,952 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 [2019-01-12 08:41:44,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:41:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:41:48,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:41:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 08:41:49,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 08:41:49,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 08:41:49,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 08:41:49,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 08:41:49,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 08:41:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 08:41:49,279 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 6 states. [2019-01-12 08:42:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:42:06,040 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-01-12 08:42:06,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 08:42:06,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-12 08:42:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:42:06,974 INFO L225 Difference]: With dead ends: 37 [2019-01-12 08:42:06,974 INFO L226 Difference]: Without dead ends: 15 [2019-01-12 08:42:06,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 08:42:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-12 08:42:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-01-12 08:42:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-12 08:42:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-12 08:42:07,014 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 7 [2019-01-12 08:42:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:42:07,014 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-12 08:42:07,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 08:42:07,015 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-12 08:42:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 08:42:07,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:42:07,015 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 08:42:07,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:42:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:42:07,016 INFO L82 PathProgramCache]: Analyzing trace with hash 729433995, now seen corresponding path program 1 times [2019-01-12 08:42:07,017 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:42:07,017 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 [2019-01-12 08:42:07,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 08:42:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 08:42:13,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:42:14,071 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-12 08:42:15,107 WARN L181 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-12 08:42:15,324 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 08:42:17,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse4))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) .cse3) .cse3)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse3 .cse3) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse4 .cse5)) (= .cse0 c_ULTIMATE.start_main_~yc~0)))) is different from true [2019-01-12 08:42:19,615 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse5 (fp.add roundNearestTiesToEven .cse6 .cse6))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse5 .cse6))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0)) (.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse2) .cse4) .cse4)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse4 .cse4) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))))) |c_ULTIMATE.start_y_#res|) (= .cse1 c_ULTIMATE.start_main_~yc~0))) is different from true [2019-01-12 08:42:19,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2019-01-12 08:42:19,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:42:23,497 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 08:42:43,000 WARN L181 SmtUtils]: Spent 4.58 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 08:42:45,978 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2019-01-12 08:42:48,942 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2019-01-12 08:42:51,930 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2019-01-12 08:42:54,930 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2019-01-12 08:42:57,976 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2019-01-12 08:43:00,986 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2019-01-12 08:43:03,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse2 (let ((.cse7 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse7 c_~ui~0))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (.cse5 (fp.sub roundNearestTiesToEven .cse2 .cse7))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 .cse4) .cse6) .cse6)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse6) (fp.sub roundNearestTiesToEven .cse4 .cse5))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2019-01-12 08:43:05,346 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse2 (let ((.cse7 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse7 c_~ui~0))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse2 (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse4 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (.cse5 (fp.sub roundNearestTiesToEven .cse2 .cse7))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 .cse4) .cse6) .cse6)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse6) (fp.sub roundNearestTiesToEven .cse4 .cse5))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2019-01-12 08:43:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-01-12 08:43:05,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 08:43:05,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-01-12 08:43:05,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 08:43:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 08:43:05,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=64, Unknown=14, NotChecked=126, Total=240 [2019-01-12 08:43:05,426 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 16 states. [2019-01-12 08:43:07,626 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse3 (let ((.cse8 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse8 c_~ui~0))) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse5 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse6 (fp.sub roundNearestTiesToEven .cse3 .cse8))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 .cse5) .cse7) .cse7)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse7) (fp.sub roundNearestTiesToEven .cse5 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq .cse0 .cse1) (= c_~ui~0 .cse2) (fp.geq .cse0 (fp.neg .cse1)) (= c_~yn~0 .cse2))) is different from false [2019-01-12 08:43:09,809 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.sub roundNearestTiesToEven .cse3 (let ((.cse8 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse8 c_~ui~0))) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse3 (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse5 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse6 (fp.sub roundNearestTiesToEven .cse3 .cse8))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 .cse5) .cse7) .cse7)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse7) (fp.sub roundNearestTiesToEven .cse5 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq .cse0 .cse1) (= c_~ui~0 .cse2) (fp.geq .cse0 (fp.neg .cse1)) (= c_~yn~0 .cse2))) is different from true [2019-01-12 08:43:12,007 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5)) (.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 .cse7))))))))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (= c_ULTIMATE.start_main_~taui~0 .cse1) (fp.geq .cse2 (fp.neg .cse3)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (fp.leq .cse2 .cse3) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse1) (= c_ULTIMATE.start_main_~taud~0 .cse1))) is different from false [2019-01-12 08:43:15,029 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5)) (.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 .cse7))))))))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (= c_ULTIMATE.start_main_~taui~0 .cse1) (fp.geq .cse2 (fp.neg .cse3)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (fp.leq .cse2 .cse3) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse1) (= c_ULTIMATE.start_main_~taud~0 .cse1))) is different from true [2019-01-12 08:43:17,532 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (fp.leq .cse1 .cse2) (= c_ULTIMATE.start_main_~taui~0 .cse3) (fp.geq .cse1 (fp.neg .cse2)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse3) (= c_ULTIMATE.start_main_~taud~0 .cse3))) is different from false [2019-01-12 08:43:20,533 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse0 c_~ui~0)) (fp.leq .cse1 .cse2) (= c_ULTIMATE.start_main_~taui~0 .cse3) (fp.geq .cse1 (fp.neg .cse2)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (= c_~ui~0 .cse0) (= c_ULTIMATE.start_main_~T~0 .cse3) (= c_ULTIMATE.start_main_~taud~0 .cse3))) is different from true [2019-01-12 08:43:22,654 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0)))))))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~taui~0 .cse0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (= .cse3 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse1)) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse3 c_ULTIMATE.start_main_~yc~0) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (fp.geq .cse4 (fp.neg .cse5)) (fp.leq .cse4 .cse5) (= c_ULTIMATE.start_main_~T~0 .cse0) (= c_ULTIMATE.start_main_~taud~0 .cse0)))) is different from false [2019-01-12 08:43:25,657 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 .cse2)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0)))))))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~taui~0 .cse0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse1 .cse2)) (= .cse3 c_ULTIMATE.start_main_~K~0) (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse1)) (= c_ULTIMATE.start_main_~epi~0 c_ULTIMATE.start_main_~sumej~0) (= .cse3 c_ULTIMATE.start_main_~yc~0) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (fp.geq .cse4 (fp.neg .cse5)) (fp.leq .cse4 .cse5) (= c_ULTIMATE.start_main_~T~0 .cse0) (= c_ULTIMATE.start_main_~taud~0 .cse0)))) is different from true [2019-01-12 08:44:03,354 WARN L181 SmtUtils]: Spent 22.32 s on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-01-12 08:44:31,566 WARN L181 SmtUtils]: Spent 23.26 s on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-01-12 08:45:15,527 WARN L181 SmtUtils]: Spent 28.20 s on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2019-01-12 08:45:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 08:45:46,344 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-12 08:45:47,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 08:45:47,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 11 [2019-01-12 08:45:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 08:45:47,384 INFO L225 Difference]: With dead ends: 21 [2019-01-12 08:45:47,384 INFO L226 Difference]: Without dead ends: 19 [2019-01-12 08:45:47,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 180.6s TimeCoverageRelationStatistics Valid=57, Invalid=109, Unknown=30, NotChecked=310, Total=506 [2019-01-12 08:45:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-12 08:45:47,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-12 08:45:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 08:45:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-12 08:45:47,395 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-01-12 08:45:47,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 08:45:47,395 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-12 08:45:47,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 08:45:47,396 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-12 08:45:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 08:45:47,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 08:45:47,396 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-01-12 08:45:47,397 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 08:45:47,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 08:45:47,397 INFO L82 PathProgramCache]: Analyzing trace with hash -678030127, now seen corresponding path program 2 times [2019-01-12 08:45:47,398 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 08:45:47,398 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 [2019-01-12 08:45:47,405 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2019-01-12 08:45:58,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 08:45:58,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 08:45:58,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 08:45:59,993 WARN L181 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-12 08:46:02,258 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0)) (= c_~ui~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 .cse0))))) (= c_ULTIMATE.start_main_~taui~0 .cse1) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse2 .cse3)) (= .cse4 c_ULTIMATE.start_main_~K~0) (= .cse4 c_ULTIMATE.start_main_~yc~0) (= (fp.add roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~epi~0) c_ULTIMATE.start_main_~sumej~0) (= c_ULTIMATE.start_main_~T~0 .cse1) (= c_ULTIMATE.start_main_~taud~0 .cse1))))) is different from false [2019-01-12 08:46:04,614 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse4 .cse5)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (= c_ULTIMATE.start_main_~taui~0 .cse0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~epi~0 .cse2)))))) (= c_ULTIMATE.start_main_~epi~0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse1)) (= .cse3 c_ULTIMATE.start_main_~K~0) (= .cse3 c_ULTIMATE.start_main_~yc~0) (= c_~yn~0 |c_ULTIMATE.start_y_#res|) (= (fp.add roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0) c_ULTIMATE.start_main_~sumej~0) (= c_ULTIMATE.start_main_~T~0 .cse0) (= c_ULTIMATE.start_main_~taud~0 .cse0))))) is different from false [2019-01-12 08:46:06,760 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse8 .cse9))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse8)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse6 .cse2)) (.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse6))))) c_~yn~0) (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse7) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse7 .cse2)))))) (= .cse1 c_ULTIMATE.start_main_~yc~0))))))) is different from false [2019-01-12 08:46:09,192 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse8 .cse9))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse8)) (.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse6 .cse2)) (.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse6))))) c_~yn~0) (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse7 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 c_~yn~0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse7) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse7 .cse2)))))) (= .cse1 c_ULTIMATE.start_main_~yc~0))))))) is different from true [2019-01-12 08:46:11,549 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_y_#res| (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse9 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse7 (fp.add roundNearestTiesToEven .cse9 .cse10))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse8 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse9)) (.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse7))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse8 .cse6)) (.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 .cse8))))))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse2) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse6))))))))))))) (= .cse1 c_ULTIMATE.start_main_~yc~0))) is different from true [2019-01-12 08:46:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2019-01-12 08:46:11,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-12 08:46:16,466 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 10 [2019-01-12 08:46:34,741 WARN L181 SmtUtils]: Spent 5.22 s on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 08:46:37,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2019-01-12 08:46:40,879 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse2) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2019-01-12 08:46:43,957 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2019-01-12 08:46:47,021 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2019-01-12 08:46:51,473 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (let ((.cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6)) (.cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0))) (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse3 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2019-01-12 08:46:55,635 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 (let ((.cse6 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 |c_ULTIMATE.start_y_#res|))) (let ((.cse4 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~sumej~0 .cse6)) (.cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~taud~0 c_ULTIMATE.start_main_~T~0))) (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse6 c_ULTIMATE.start_main_~epi~0))))))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_ULTIMATE.start_main_~T~0) c_ULTIMATE.start_main_~taui~0)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse3 .cse6))))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2019-01-12 08:46:57,671 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-12 08:46:57,872 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-01-12 08:46:57,874 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:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) 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:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) 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:456) 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:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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) ... 40 more [2019-01-12 08:46:57,880 INFO L168 Benchmark]: Toolchain (without parser) took 316915.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 951.3 MB in the beginning and 936.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 131.5 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,881 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:46:57,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 08:46:57,884 INFO L168 Benchmark]: Boogie Preprocessor took 31.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,886 INFO L168 Benchmark]: RCFGBuilder took 3523.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,887 INFO L168 Benchmark]: TraceAbstraction took 313043.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 936.3 MB in the end (delta: 149.6 MB). Peak memory consumption was 149.6 MB. Max. memory is 11.5 GB. [2019-01-12 08:46:57,894 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.77 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.15 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3523.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 313043.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 936.3 MB in the end (delta: 149.6 MB). Peak memory consumption was 149.6 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...