./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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-newlib/double_req_bl_1231b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c714d208cb0b1f96f572e8a6108248eb76c73a94 ......................................................................................................................................................................................................................................................................................................................................................... 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-newlib/double_req_bl_1231b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c714d208cb0b1f96f572e8a6108248eb76c73a94 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:37,348 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:37,350 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:37,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:37,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:37,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:37,374 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:37,376 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:37,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:37,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:37,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:37,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:37,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:37,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:37,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:37,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:37,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:37,387 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:37,389 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:37,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:37,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:37,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:37,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:37,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:37,401 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:37,404 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:37,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:37,407 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:37,408 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:37,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:37,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:37,411 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:37,411 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:37,411 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:37,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:37,416 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:37,418 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:58:37,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:37,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:37,452 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:37,452 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:37,452 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:37,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:37,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:37,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:58:37,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:37,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:37,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:37,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:37,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:37,455 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:37,456 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:37,457 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:37,457 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:37,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:37,457 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:37,457 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:37,457 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:37,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:37,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:37,460 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:37,460 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:37,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:58:37,461 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:37,462 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:58:37,462 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2018-12-31 03:58:37,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:37,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:37,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:37,550 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:37,550 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:37,551 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-12-31 03:58:37,605 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b401f007d/4813fd60bac64817a8598143e68de471/FLAG8e1380b31 [2018-12-31 03:58:38,041 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:38,042 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-12-31 03:58:38,049 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b401f007d/4813fd60bac64817a8598143e68de471/FLAG8e1380b31 [2018-12-31 03:58:38,398 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b401f007d/4813fd60bac64817a8598143e68de471 [2018-12-31 03:58:38,402 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:38,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:38,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:38,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:38,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:38,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5080a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38, skipping insertion in model container [2018-12-31 03:58:38,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:38,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:38,686 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:38,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:38,722 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:38,754 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:38,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38 WrapperNode [2018-12-31 03:58:38,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:38,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:38,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:38,757 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:38,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:38,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:38,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:38,820 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:38,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:38,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:38,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:38,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:38,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:58:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:39,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:58:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:39,659 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:39,659 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:39,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:39 BoogieIcfgContainer [2018-12-31 03:58:39,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:39,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:39,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:39,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:39,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:38" (1/3) ... [2018-12-31 03:58:39,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aff792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:39, skipping insertion in model container [2018-12-31 03:58:39,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38" (2/3) ... [2018-12-31 03:58:39,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aff792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:39, skipping insertion in model container [2018-12-31 03:58:39,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:39" (3/3) ... [2018-12-31 03:58:39,669 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2018-12-31 03:58:39,679 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:39,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:39,705 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:39,744 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:39,745 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:39,745 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:39,745 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:39,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:39,746 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:39,746 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:39,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:39,746 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-31 03:58:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:39,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:39,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:39,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2018-12-31 03:58:39,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:39,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:39,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:39,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:39,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:39,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:39,943 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-12-31 03:58:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:39,964 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2018-12-31 03:58:39,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:39,965 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:58:39,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:39,976 INFO L225 Difference]: With dead ends: 56 [2018-12-31 03:58:39,976 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:58:39,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:58:40,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:58:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:58:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-12-31 03:58:40,015 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2018-12-31 03:58:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:40,015 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-31 03:58:40,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2018-12-31 03:58:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:58:40,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:40,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:40,016 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:40,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:40,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2018-12-31 03:58:40,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:40,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:40,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:40,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:40,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:40,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:40,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:40,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:40,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:40,128 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2018-12-31 03:58:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:40,376 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-31 03:58:40,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:40,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:58:40,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:40,378 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:58:40,378 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:40,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:58:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:40,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2018-12-31 03:58:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:40,387 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:40,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:40,387 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:40,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:40,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:40,389 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2018-12-31 03:58:40,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:40,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:40,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:40,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:40,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:40,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:40,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:40,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:40,485 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:58:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:40,673 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:58:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:40,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-31 03:58:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:40,675 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:58:40,676 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:40,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:58:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:40,682 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2018-12-31 03:58:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:40,683 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:40,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:40,684 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:40,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:40,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:40,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:40,686 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:40,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2018-12-31 03:58:40,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:40,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:40,772 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:58:40,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:40 BoogieIcfgContainer [2018-12-31 03:58:40,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:40,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:40,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:40,809 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:40,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:39" (3/4) ... [2018-12-31 03:58:40,815 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:58:40,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:40,817 INFO L168 Benchmark]: Toolchain (without parser) took 2413.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -78.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:40,819 INFO L168 Benchmark]: CDTParser took 0.20 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. [2018-12-31 03:58:40,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:40,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.86 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 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. [2018-12-31 03:58:40,821 INFO L168 Benchmark]: Boogie Preprocessor took 108.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:40,824 INFO L168 Benchmark]: RCFGBuilder took 731.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:40,825 INFO L168 Benchmark]: TraceAbstraction took 1146.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:40,825 INFO L168 Benchmark]: Witness Printer took 6.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:40,833 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 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 350.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 62.86 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 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. * Boogie Preprocessor took 108.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -167.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 731.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1146.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. * Witness Printer took 6.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; [L16] return x != x; [L62] COND TRUE !isnan_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x [L68] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 20 SDslu, 118 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-2e94e6a [2018-12-31 03:58:43,225 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:43,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:43,244 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:43,245 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:43,246 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:43,247 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:43,249 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:43,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:43,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:43,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:43,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:43,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:43,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:43,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:43,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:43,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:43,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:43,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:43,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:43,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:43,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:43,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:43,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:43,269 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:43,270 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:43,271 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:43,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:43,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:43,280 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:43,280 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:43,281 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:43,281 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:43,282 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:43,283 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:43,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:43,286 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:58:43,314 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:43,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:43,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:43,318 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:43,318 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:43,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:43,318 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:43,319 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:43,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:43,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:43,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:43,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:43,319 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:58:43,321 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:58:43,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:43,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:43,321 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:43,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:43,323 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:43,323 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:43,323 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:43,323 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:43,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:43,324 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:43,324 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:43,324 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:43,324 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:58:43,324 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:43,325 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:58:43,326 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:58:43,326 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2018-12-31 03:58:43,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:43,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:43,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:43,417 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:43,417 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:43,418 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-12-31 03:58:43,484 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9d86051/28572252048f439ab9ab4a925f0250c9/FLAGb66ea9936 [2018-12-31 03:58:43,918 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:43,919 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-12-31 03:58:43,926 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9d86051/28572252048f439ab9ab4a925f0250c9/FLAGb66ea9936 [2018-12-31 03:58:44,283 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9d86051/28572252048f439ab9ab4a925f0250c9 [2018-12-31 03:58:44,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:44,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:44,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:44,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:44,296 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:44,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65e2471 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44, skipping insertion in model container [2018-12-31 03:58:44,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:44,331 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:44,576 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:44,587 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:44,633 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:44,681 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:44,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44 WrapperNode [2018-12-31 03:58:44,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:44,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:44,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:44,684 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:44,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:44,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:44,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:44,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:44,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... [2018-12-31 03:58:44,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:44,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:44,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:44,866 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:44,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:58:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:58:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:45,254 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:45,563 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:45,597 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:45,597 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:45,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:45 BoogieIcfgContainer [2018-12-31 03:58:45,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:45,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:45,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:45,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:45,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:44" (1/3) ... [2018-12-31 03:58:45,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fbf6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:45, skipping insertion in model container [2018-12-31 03:58:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:44" (2/3) ... [2018-12-31 03:58:45,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8fbf6da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:45, skipping insertion in model container [2018-12-31 03:58:45,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:45" (3/3) ... [2018-12-31 03:58:45,609 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2018-12-31 03:58:45,620 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:45,629 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:45,649 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:45,684 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:45,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:45,686 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:45,686 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:45,686 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:45,686 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:45,687 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:45,687 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:45,687 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-12-31 03:58:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:45,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:45,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:45,715 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2018-12-31 03:58:45,724 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:45,725 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:45,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:45,811 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:45,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:45,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:45,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:45,848 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-12-31 03:58:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:45,867 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2018-12-31 03:58:45,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:45,868 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-31 03:58:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:45,880 INFO L225 Difference]: With dead ends: 56 [2018-12-31 03:58:45,880 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:58:45,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:58:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:58:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:58:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2018-12-31 03:58:45,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2018-12-31 03:58:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:45,922 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-12-31 03:58:45,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2018-12-31 03:58:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:58:45,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:45,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:45,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:45,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:45,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2018-12-31 03:58:45,926 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:45,926 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:45,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:46,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:46,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:46,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:46,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:46,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:46,100 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2018-12-31 03:58:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:46,833 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2018-12-31 03:58:46,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:46,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:58:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:46,836 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:58:46,836 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:46,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:58:46,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:46,853 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2018-12-31 03:58:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:46,855 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:46,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:58:46,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:46,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:46,857 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:46,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2018-12-31 03:58:46,859 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:46,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:46,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:46,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:47,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:47,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:47,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:47,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:47,009 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:58:47,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:47,234 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:58:47,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:47,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 03:58:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:47,237 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:58:47,237 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:47,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:58:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:47,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2018-12-31 03:58:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:47,245 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:47,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:47,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:47,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:47,248 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:47,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2018-12-31 03:58:47,251 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:47,251 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:58:47,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:47,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:47,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:47,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:47,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:47,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:47,372 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:58:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,798 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:58:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:49,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:58:49,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,802 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:58:49,802 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:49,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:49,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:58:49,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:49,809 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2018-12-31 03:58:49,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:49,809 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:49,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:49,809 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:49,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:49,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:49,810 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:49,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2018-12-31 03:58:49,811 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:49,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:49,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:49,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:49,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:49,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:49,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:49,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:49,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:49,907 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2018-12-31 03:58:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:50,130 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2018-12-31 03:58:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:50,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-31 03:58:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:50,137 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:58:50,137 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:50,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:58:50,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2018-12-31 03:58:50,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2018-12-31 03:58:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:50,146 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-12-31 03:58:50,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2018-12-31 03:58:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:50,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:50,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:50,147 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2018-12-31 03:58:50,150 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:50,150 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:50,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:50,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:50,501 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:50,513 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:50,527 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:50,539 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:50,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2018-12-31 03:58:50,713 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-31 03:58:50,733 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:50,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2018-12-31 03:58:50,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:50,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-31 03:58:50,895 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 03:58:50,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-12-31 03:58:50,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:51,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:51,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-31 03:58:51,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-12-31 03:58:51,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:51,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:51,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:51,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:58:51,231 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:88, output treesize:29 [2018-12-31 03:58:52,992 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_q#valueAsBitvector_3|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (fp.eq .cse0 .cse0)) (= c_ULTIMATE.start___fpclassify_double_~lsw~0 .cse1) (= ((_ extract 63 32) v_prenex_9) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) v_prenex_9) .cse1)))) is different from true [2018-12-31 03:59:01,399 WARN L181 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-12-31 03:59:03,652 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2018-12-31 03:59:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:03,664 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:03,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:03,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:59:03,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:59:03,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:59:03,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2018-12-31 03:59:03,678 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 8 states. [2018-12-31 03:59:08,136 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-31 03:59:14,389 WARN L181 SmtUtils]: Spent 6.21 s on a formula simplification that was a NOOP. DAG size: 48 [2018-12-31 03:59:14,649 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-12-31 03:59:21,282 WARN L181 SmtUtils]: Spent 6.11 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-31 03:59:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:25,843 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2018-12-31 03:59:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 03:59:25,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-31 03:59:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:25,845 INFO L225 Difference]: With dead ends: 62 [2018-12-31 03:59:25,846 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 03:59:25,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=56, Invalid=128, Unknown=2, NotChecked=24, Total=210 [2018-12-31 03:59:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 03:59:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2018-12-31 03:59:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2018-12-31 03:59:25,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2018-12-31 03:59:25,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:25,860 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2018-12-31 03:59:25,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:59:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2018-12-31 03:59:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:59:25,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:25,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:25,862 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2018-12-31 03:59:25,863 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:25,863 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:25,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:25,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:25,956 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:25,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:25,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:25,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:25,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:25,967 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2018-12-31 03:59:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:26,134 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-12-31 03:59:26,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:26,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 03:59:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:26,135 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:26,135 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:26,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:26,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:26,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:59:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-31 03:59:26,145 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2018-12-31 03:59:26,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:26,146 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-31 03:59:26,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2018-12-31 03:59:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:59:26,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:26,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:26,147 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash -666515868, now seen corresponding path program 1 times [2018-12-31 03:59:26,147 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:26,147 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:26,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:26,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:26,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:26,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:26,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:26,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:26,259 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2018-12-31 03:59:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:26,442 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-12-31 03:59:26,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:26,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 03:59:26,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:26,444 INFO L225 Difference]: With dead ends: 42 [2018-12-31 03:59:26,445 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:26,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-31 03:59:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-31 03:59:26,455 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2018-12-31 03:59:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:26,455 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-31 03:59:26,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2018-12-31 03:59:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:59:26,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:26,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:26,458 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:26,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2018-12-31 03:59:26,459 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:26,459 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:26,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:26,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:26,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:26,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:26,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:26,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:26,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:26,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:26,574 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2018-12-31 03:59:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:26,617 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-12-31 03:59:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:26,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 03:59:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:26,619 INFO L225 Difference]: With dead ends: 33 [2018-12-31 03:59:26,620 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 03:59:26,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 03:59:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-31 03:59:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 03:59:26,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2018-12-31 03:59:26,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:26,631 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 03:59:26,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 03:59:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:59:26,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:26,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:26,634 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2018-12-31 03:59:26,634 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:26,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:26,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:26,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:26,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:26,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:26,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:59:26,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:59:26,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:59:26,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:59:26,813 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2018-12-31 03:59:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:27,196 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-12-31 03:59:27,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:59:27,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 03:59:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:27,200 INFO L225 Difference]: With dead ends: 38 [2018-12-31 03:59:27,200 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 03:59:27,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:59:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 03:59:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-12-31 03:59:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-31 03:59:27,212 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-12-31 03:59:27,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:27,213 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-31 03:59:27,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:59:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-31 03:59:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:59:27,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:27,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:27,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 782688991, now seen corresponding path program 1 times [2018-12-31 03:59:27,219 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:27,219 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:27,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:27,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:27,313 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:27,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:27,326 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2018-12-31 03:59:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:27,555 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-31 03:59:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:27,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-31 03:59:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:27,560 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:27,560 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:27,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-12-31 03:59:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:59:27,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-31 03:59:27,574 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2018-12-31 03:59:27,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:27,574 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-31 03:59:27,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:27,574 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-31 03:59:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-31 03:59:27,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:27,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:27,575 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:27,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:27,575 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2018-12-31 03:59:27,578 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:27,578 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:27,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:27,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:28,101 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-31 03:59:28,423 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-31 03:59:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:28,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:28,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:28,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:59:28,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:59:28,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:59:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:59:28,555 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2018-12-31 03:59:30,391 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2018-12-31 03:59:30,917 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-12-31 03:59:31,345 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2018-12-31 03:59:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:31,491 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-12-31 03:59:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:59:31,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-31 03:59:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:31,493 INFO L225 Difference]: With dead ends: 50 [2018-12-31 03:59:31,493 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 03:59:31,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:59:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 03:59:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2018-12-31 03:59:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-31 03:59:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-31 03:59:31,515 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2018-12-31 03:59:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:31,515 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-31 03:59:31,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:59:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-31 03:59:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:59:31,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:31,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:31,516 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1085928516, now seen corresponding path program 1 times [2018-12-31 03:59:31,522 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:31,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:59:31,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:31,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:31,762 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:31,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:59:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:59:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:59:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:59:31,774 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2018-12-31 03:59:32,210 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-12-31 03:59:32,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:32,314 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-31 03:59:32,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:59:32,315 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-31 03:59:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:32,316 INFO L225 Difference]: With dead ends: 40 [2018-12-31 03:59:32,316 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:32,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:59:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:32,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-12-31 03:59:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-12-31 03:59:32,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2018-12-31 03:59:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:32,326 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-12-31 03:59:32,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:59:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-12-31 03:59:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:59:32,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:32,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:32,327 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:32,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:32,327 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2018-12-31 03:59:32,327 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:32,327 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:32,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:32,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:32,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:32,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:32,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:32,485 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:59:32,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2018-12-31 03:59:32,547 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2018-12-31 03:59:32,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:32,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-31 03:59:32,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:32,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-12-31 03:59:32,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-12-31 03:59:32,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:59:32,625 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:32,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:59:32,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:59:32,661 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:31 [2018-12-31 03:59:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:32,732 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:32,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:59:32,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:59:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:59:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:59:32,748 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2018-12-31 03:59:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:33,331 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-31 03:59:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:59:33,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-31 03:59:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:33,336 INFO L225 Difference]: With dead ends: 34 [2018-12-31 03:59:33,336 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:59:33,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:59:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:59:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:59:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:59:33,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-31 03:59:33,348 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2018-12-31 03:59:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:33,350 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-31 03:59:33,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:59:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-31 03:59:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:59:33,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:33,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:33,351 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2018-12-31 03:59:33,354 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:33,354 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:59:33,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:33,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:33,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:33,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:33,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:33,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:33,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:33,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:33,549 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2018-12-31 03:59:33,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:33,790 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-31 03:59:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:33,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-31 03:59:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:33,791 INFO L225 Difference]: With dead ends: 26 [2018-12-31 03:59:33,791 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:59:33,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:59:33,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:59:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:59:33,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:59:33,794 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-31 03:59:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:33,794 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:59:33,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:59:33,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:59:33,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:59:34,010 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 136 [2018-12-31 03:59:35,494 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 136 DAG size of output: 31 [2018-12-31 03:59:35,629 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-12-31 03:59:36,115 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 39 [2018-12-31 03:59:36,254 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-12-31 03:59:46,909 WARN L181 SmtUtils]: Spent 10.65 s on a formula simplification. DAG size of input: 144 DAG size of output: 45 [2018-12-31 03:59:46,912 INFO L451 ceAbstractionStarter]: At program point L73(lines 53 74) the Hoare annotation is: true [2018-12-31 03:59:46,912 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:59:46,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:59:46,912 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:59:46,913 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-12-31 03:59:46,913 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:46,913 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2018-12-31 03:59:46,913 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) .cse0))) (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) [2018-12-31 03:59:46,913 INFO L448 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2018-12-31 03:59:46,913 INFO L444 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:46,913 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2018-12-31 03:59:46,914 INFO L448 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2018-12-31 03:59:46,914 INFO L444 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (or (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (exists ((v_prenex_14 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)) ULTIMATE.start_fmin_double_~x) (= ((_ extract 63 32) v_prenex_14) ULTIMATE.start___fpclassify_double_~msw~0))) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:46,914 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32)) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (.cse1 ((_ extract 31 0) v_prenex_16))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_5|)) (= ((_ extract 63 32) v_prenex_16) .cse2) (= .cse2 ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:46,914 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-12-31 03:59:46,914 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2018-12-31 03:59:46,914 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L448 ceAbstractionStarter]: For program point L62-2(lines 62 71) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-12-31 03:59:46,915 INFO L444 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_main_~x~0 |ULTIMATE.start_fmin_double_#res|) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2018-12-31 03:59:46,916 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 70) no Hoare annotation was computed. [2018-12-31 03:59:46,916 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-12-31 03:59:46,916 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2018-12-31 03:59:46,916 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2018-12-31 03:59:46,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-12-31 03:59:46,916 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-12-31 03:59:46,938 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,939 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,941 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,941 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,950 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,953 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,954 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:46,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,955 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,959 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,961 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:46,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:46,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,969 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,971 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,971 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:46,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:46,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:46,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:46,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,977 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,978 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,983 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,988 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,989 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:46,990 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:46,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:59:46 BoogieIcfgContainer [2018-12-31 03:59:46,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:59:46,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:59:46,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:59:46,995 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:59:46,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:45" (3/4) ... [2018-12-31 03:59:47,005 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:59:47,020 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 03:59:47,020 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 03:59:47,020 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 03:59:47,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:47,048 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && x == x) && x == x) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:47,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && x == x) && x == x) && (\exists v_prenex_14 : bv64 :: ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) == x && v_prenex_14[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:47,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && x == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:47,049 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:47,052 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:47,088 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:59:47,088 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:59:47,089 INFO L168 Benchmark]: Toolchain (without parser) took 62800.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 951.4 MB in the beginning and 832.1 MB in the end (delta: 119.2 MB). Peak memory consumption was 316.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:47,091 INFO L168 Benchmark]: CDTParser took 0.16 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. [2018-12-31 03:59:47,091 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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. [2018-12-31 03:59:47,092 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.11 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:47,093 INFO L168 Benchmark]: Boogie Preprocessor took 126.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:47,094 INFO L168 Benchmark]: RCFGBuilder took 732.76 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:47,094 INFO L168 Benchmark]: TraceAbstraction took 61395.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 839.1 MB in the end (delta: 265.1 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:47,096 INFO L168 Benchmark]: Witness Printer took 93.63 ms. Allocated memory is still 1.2 GB. Free memory was 839.1 MB in the beginning and 832.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:47,101 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.16 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 391.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 55.11 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -187.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 732.76 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: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61395.37 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 839.1 MB in the end (delta: 265.1 MB). Peak memory consumption was 325.9 MB. Max. memory is 11.5 GB. * Witness Printer took 93.63 ms. Allocated memory is still 1.2 GB. Free memory was 839.1 MB in the beginning and 832.1 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant [2018-12-31 03:59:47,118 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,118 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,119 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,119 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,122 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,122 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,123 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:59:47,123 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,123 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && x == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 16]: Loop Invariant [2018-12-31 03:59:47,124 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,124 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 20]: Loop Invariant [2018-12-31 03:59:47,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,128 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && x == x) && x == x) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2018-12-31 03:59:47,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:47,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:47,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:47,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,134 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,134 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,135 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,135 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:47,135 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2018-12-31 03:59:47,136 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,137 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,140 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:59:47,140 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,140 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 20]: Loop Invariant [2018-12-31 03:59:47,141 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,141 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,141 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,141 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,145 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,145 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2018-12-31 03:59:47,145 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,146 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,147 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:47,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2018-12-31 03:59:47,148 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && x == x) && x == x) && (\exists v_prenex_14 : bv64 :: ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) == x && v_prenex_14[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 61.2s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 31.1s AutomataDifference, 0.0s DeadEndRemovalTime, 13.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 486 SDtfs, 406 SDslu, 710 SDs, 0 SdLazy, 365 SolverSat, 18 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 11.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 32.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 257 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1744 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16262 FormulaSimplificationTreeSizeReductionInter, 12.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 26 QuantifiedInterpolants, 28328 SizeOfPredicates, 53 NumberOfNonLiveVariables, 900 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...