/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684a_true-unreach-call.c --full-output --architecture 32bit --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5eb3fea6 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684a_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 b6e14d9043cb09b811e844719c56ad84744abca8 --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ............................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684a_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 b6e14d9043cb09b811e844719c56ad84744abca8 --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:24:46,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:24:46,641 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:24:46,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:24:46,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:24:46,656 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:24:46,657 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:24:46,662 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:24:46,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:24:46,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:24:46,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:24:46,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:24:46,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:24:46,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:24:46,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:24:46,671 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:24:46,672 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:24:46,674 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:24:46,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:24:46,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:24:46,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:24:46,682 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:24:46,685 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:24:46,685 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:24:46,685 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:24:46,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:24:46,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:24:46,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:24:46,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:24:46,692 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:24:46,692 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:24:46,693 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:24:46,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:24:46,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:24:46,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:24:46,696 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:24:46,697 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 18:24:46,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:24:46,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:24:46,718 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:24:46,718 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:24:46,720 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:24:46,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:24:46,720 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:24:46,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:24:46,720 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:24:46,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:24:46,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:24:46,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:24:46,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:24:46,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:24:46,724 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:24:46,724 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:24:46,724 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:24:46,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:24:46,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:24:46,725 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:24:46,725 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:24:46,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:24:46,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:24:46,726 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:24:46,726 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:24:46,726 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:24:46,726 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:24:46,729 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:24:46,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:24:46,730 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 -> b6e14d9043cb09b811e844719c56ad84744abca8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:24:46,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:24:46,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:24:46,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:24:46,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:24:46,807 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:24:46,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-09-21 18:24:47,155 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5341f672c/25eb2d6aff0b416b94fd4867d89cd312/FLAGd0f551669 [2018-09-21 18:24:47,313 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:24:47,314 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-09-21 18:24:47,326 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5341f672c/25eb2d6aff0b416b94fd4867d89cd312/FLAGd0f551669 [2018-09-21 18:24:47,345 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5341f672c/25eb2d6aff0b416b94fd4867d89cd312 [2018-09-21 18:24:47,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:24:47,357 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:24:47,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:24:47,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:24:47,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:24:47,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a04d556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47, skipping insertion in model container [2018-09-21 18:24:47,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,390 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:24:47,737 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:24:47,770 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:24:47,810 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:24:47,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47 WrapperNode [2018-09-21 18:24:47,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:24:47,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:24:47,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:24:47,860 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:24:47,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... [2018-09-21 18:24:47,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:24:47,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:24:47,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:24:47,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:24:47,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:24:48,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:24:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:24:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-21 18:24:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2018-09-21 18:24:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2f [2018-09-21 18:24:48,109 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-21 18:24:48,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:24:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:24:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:24:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-21 18:24:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:24:48,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-21 18:24:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-21 18:24:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:24:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-21 18:24:48,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-21 18:24:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2018-09-21 18:24:48,112 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2f [2018-09-21 18:24:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-21 18:24:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:24:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:24:48,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:24:48,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-21 18:24:48,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-21 18:24:49,304 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:24:49,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:24:49 BoogieIcfgContainer [2018-09-21 18:24:49,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:24:49,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:24:49,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:24:49,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:24:49,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:24:47" (1/3) ... [2018-09-21 18:24:49,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b0b4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:24:49, skipping insertion in model container [2018-09-21 18:24:49,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:47" (2/3) ... [2018-09-21 18:24:49,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b0b4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:24:49, skipping insertion in model container [2018-09-21 18:24:49,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:24:49" (3/3) ... [2018-09-21 18:24:49,313 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684a_true-unreach-call.c [2018-09-21 18:24:49,324 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:24:49,333 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:24:49,378 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:24:49,379 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:24:49,379 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:24:49,379 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:24:49,379 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:24:49,379 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:24:49,379 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:24:49,380 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:24:49,380 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:24:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-09-21 18:24:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-21 18:24:49,415 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:24:49,416 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:24:49,419 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:24:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash 412578962, now seen corresponding path program 1 times [2018-09-21 18:24:49,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:24:49,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:24:49,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:24:49,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:24:49,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:24:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:24:49,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:24:49,642 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:24:49,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:24:49,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:24:49,661 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:24:49,662 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:24:49,665 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 2 states. [2018-09-21 18:24:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:24:49,707 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2018-09-21 18:24:49,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:24:49,709 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-09-21 18:24:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:24:49,724 INFO L225 Difference]: With dead ends: 173 [2018-09-21 18:24:49,724 INFO L226 Difference]: Without dead ends: 168 [2018-09-21 18:24:49,727 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:24:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-21 18:24:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-21 18:24:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-21 18:24:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2018-09-21 18:24:49,795 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 26 [2018-09-21 18:24:49,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:24:49,796 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2018-09-21 18:24:49,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:24:49,796 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2018-09-21 18:24:49,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-21 18:24:49,798 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:24:49,799 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:24:49,799 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:24:49,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1377003294, now seen corresponding path program 1 times [2018-09-21 18:24:49,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-21 18:24:49,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-21 18:24:49,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:24:49,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:24:49,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-21 18:24:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:24:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-21 18:24:50,124 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-21 18:24:50,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:24:50 BoogieIcfgContainer [2018-09-21 18:24:50,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:24:50,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:24:50,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:24:50,224 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:24:50,225 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:24:49" (3/4) ... [2018-09-21 18:24:50,230 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-21 18:24:50,230 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:24:50,232 INFO L168 Benchmark]: Toolchain (without parser) took 2879.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 951.8 MB in the beginning and 1.1 GB in the end (delta: -110.1 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:24:50,234 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:24:50,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:24:50,236 INFO L168 Benchmark]: Boogie Preprocessor took 99.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:24:50,237 INFO L168 Benchmark]: RCFGBuilder took 1344.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-09-21 18:24:50,240 INFO L168 Benchmark]: TraceAbstraction took 917.77 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: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:24:50,241 INFO L168 Benchmark]: Witness Printer took 6.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:24:50,247 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.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 500.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.55 ms. Allocated memory is still 1.0 GB. Free memory was 935.7 MB in the beginning and 930.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1344.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 930.4 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 917.77 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: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * Witness Printer took 6.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 244]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 243, overapproximation of someUnaryDOUBLEoperation at line 42, overapproximation of bitwiseAnd at line 133, overapproximation of someBinaryArithmeticFLOAToperation at line 135. Possible FailurePath: [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L27-L32] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L34-L39] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L41-L45] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L47-L49] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L115-L116] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [\old(huge_atan)=10737418255, \old(one_atan)=10737418241, \old(pi)=10737418250, \old(pi_lo_atan2)=10737418263, \old(pi_o_2)=10737418242, \old(pi_o_4)=10737418247, \old(tiny_atan2)=10737418257, \old(zero_atan2)=10737418256, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L234] float x = __VERIFIER_nondet_float(); [L235] float y = 1.0f / 0.0f; VAL [huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L238] CALL isfinite_float(x) VAL [\old(x)=10737418248, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L217] __int32_t ix; VAL [\old(x)=10737418248, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L219] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418248, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L220] FCALL gf_u.value = (x) VAL [\old(x)=10737418248, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L221] EXPR, FCALL gf_u.word VAL [\old(x)=10737418248, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L221] (ix) = gf_u.word VAL [\old(x)=10737418248, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, ix=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L221] FCALL (ix) = gf_u.word VAL [(ix) = gf_u.word=10737418254, \old(x)=10737418248, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, ix=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L222] COND FALSE !(0) VAL [\old(x)=10737418248, huge_atan=1000000000000000000000000000000, ix=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L223] ix &= 0x7fffffff [L224] RET return (((ix) < 0x7f800000L)); VAL [\old(x)=10737418248, \result=1, huge_atan=1000000000000000000000000000000, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L238] isfinite_float(x) VAL [huge_atan=1000000000000000000000000000000, isfinite_float(x)=1, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, zero_atan2=0] [L238] COND TRUE isfinite_float(x) [L240] CALL, EXPR __ieee754_atan2f(y, x) VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L119] float z; [L120] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L123] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L124] FCALL gf_u.value = (x) VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L125] EXPR, FCALL gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L125] (hx) = gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L125] FCALL (hx) = gf_u.word VAL [(hx) = gf_u.word=10737418246, \old(x)=10737418248, \old(y)=10737418243, gf_u={10737418258:0}, gf_u.word=10737418240, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L126] COND FALSE !(0) VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L127] ix = hx & 0x7fffffff VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L129] FCALL ieee_float_shape_type gf_u; VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L130] FCALL gf_u.value = (y) VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L131] EXPR, FCALL gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, gf_u.word=-6442450944, huge_atan=1000000000000000000000000000000, hx=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L131] (hy) = gf_u.word VAL [\old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, gf_u.word=-6442450944, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L131] FCALL (hy) = gf_u.word VAL [(hy) = gf_u.word=10737418249, \old(x)=10737418248, \old(y)=10737418243, gf_u={10737418261:0}, gf_u.word=-6442450944, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L132] COND FALSE !(0) VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L133] iy = hy & 0x7fffffff VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L134] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L135] RET return x + y; VAL [\old(x)=10737418248, \old(y)=10737418243, huge_atan=1000000000000000000000000000000, hx=-2147483648, hy=-2147483648, ix=2139095041, iy=2139095041, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L240] EXPR __ieee754_atan2f(y, x) VAL [__ieee754_atan2f(y, x)=10737418253, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L240] float res = __ieee754_atan2f(y, x); [L243] COND TRUE res != pi_o_2 VAL [huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=10737418253, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] [L244] __VERIFIER_error() VAL [huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=10737418253, tiny_atan2=1/1000000000000000000000000000000, x=10737418248, y=10737418243, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 173 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 213 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:24:52,707 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:24:52,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:24:52,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:24:52,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:24:52,723 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:24:52,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:24:52,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:24:52,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:24:52,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:24:52,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:24:52,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:24:52,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:24:52,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:24:52,736 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:24:52,737 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:24:52,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:24:52,740 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:24:52,742 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:24:52,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:24:52,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:24:52,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:24:52,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:24:52,750 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:24:52,750 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:24:52,752 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:24:52,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:24:52,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:24:52,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:24:52,756 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:24:52,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:24:52,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:24:52,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:24:52,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:24:52,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:24:52,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:24:52,761 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 18:24:52,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:24:52,777 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:24:52,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:24:52,778 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:24:52,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:24:52,780 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:24:52,780 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:24:52,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:24:52,780 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:24:52,780 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:24:52,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:24:52,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:24:52,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:24:52,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:24:52,782 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:24:52,782 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:24:52,782 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:24:52,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:24:52,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:24:52,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:24:52,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:24:52,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:24:52,783 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:24:52,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:24:52,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:24:52,785 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:24:52,785 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:24:52,786 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:24:52,786 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:24:52,786 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:24:52,786 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:24:52,786 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 -> b6e14d9043cb09b811e844719c56ad84744abca8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:24:52,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:24:52,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:24:52,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:24:52,867 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:24:52,868 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:24:52,868 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-09-21 18:24:53,230 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9b90ffb/d0ac0386e99f4bc19dce970198f59596/FLAGe21cc8e13 [2018-09-21 18:24:53,481 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:24:53,481 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0684a_true-unreach-call.c [2018-09-21 18:24:53,491 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9b90ffb/d0ac0386e99f4bc19dce970198f59596/FLAGe21cc8e13 [2018-09-21 18:24:53,508 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb9b90ffb/d0ac0386e99f4bc19dce970198f59596 [2018-09-21 18:24:53,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:24:53,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:24:53,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:24:53,518 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:24:53,525 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:24:53,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:24:53" (1/1) ... [2018-09-21 18:24:53,530 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbaf814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:53, skipping insertion in model container [2018-09-21 18:24:53,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:24:53" (1/1) ... [2018-09-21 18:24:53,544 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:24:53,849 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:24:53,895 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:24:53,964 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:24:54,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54 WrapperNode [2018-09-21 18:24:54,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:24:54,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:24:54,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:24:54,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:24:54,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... [2018-09-21 18:24:54,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:24:54,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:24:54,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:24:54,142 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:24:54,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:24:54,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:24:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:24:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-21 18:24:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2018-09-21 18:24:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_atan2f [2018-09-21 18:24:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-21 18:24:54,295 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:24:54,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:24:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:24:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-21 18:24:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2018-09-21 18:24:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_atan2f [2018-09-21 18:24:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-21 18:24:54,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:24:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:24:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:24:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-21 18:24:54,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:24:54,560 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:54,605 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:54,740 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:54,754 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:55,810 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:55,838 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:56,673 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:56,699 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:58,955 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:24:58,961 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:01,729 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:03,912 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:25:09,292 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:25:09,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:09 BoogieIcfgContainer [2018-09-21 18:25:09,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:25:09,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:25:09,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:25:09,297 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:25:09,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:24:53" (1/3) ... [2018-09-21 18:25:09,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29849149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:25:09, skipping insertion in model container [2018-09-21 18:25:09,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:24:54" (2/3) ... [2018-09-21 18:25:09,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29849149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:25:09, skipping insertion in model container [2018-09-21 18:25:09,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:09" (3/3) ... [2018-09-21 18:25:09,302 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684a_true-unreach-call.c [2018-09-21 18:25:09,311 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:25:09,319 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:25:09,360 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:25:09,361 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:25:09,361 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:25:09,361 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:25:09,361 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:25:09,361 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:25:09,362 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:25:09,362 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:25:09,362 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:25:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states. [2018-09-21 18:25:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-21 18:25:09,402 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:09,403 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:09,406 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash -516610885, now seen corresponding path program 1 times [2018-09-21 18:25:09,416 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:09,416 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-21 18:25:09,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:09,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:09,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:09,598 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:09,615 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:09,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:25:09,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:25:09,632 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:25:09,633 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:25:09,636 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 2 states. [2018-09-21 18:25:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:09,669 INFO L93 Difference]: Finished difference Result 172 states and 212 transitions. [2018-09-21 18:25:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:25:09,671 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-21 18:25:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:09,687 INFO L225 Difference]: With dead ends: 172 [2018-09-21 18:25:09,688 INFO L226 Difference]: Without dead ends: 167 [2018-09-21 18:25:09,690 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:25:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-21 18:25:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-21 18:25:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-21 18:25:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2018-09-21 18:25:09,754 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 25 [2018-09-21 18:25:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:09,754 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2018-09-21 18:25:09,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:25:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2018-09-21 18:25:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-21 18:25:09,757 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:09,757 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:09,758 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:09,758 INFO L82 PathProgramCache]: Analyzing trace with hash 2008941523, now seen corresponding path program 1 times [2018-09-21 18:25:09,759 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:09,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-21 18:25:09,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:09,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:10,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:10,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:10,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:10,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:10,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:10,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:10,096 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:10,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:10,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:10,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:10,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:10,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:10,522 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-21 18:25:10,957 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:25:11,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:11,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:11,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:25:11,361 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:11,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:11,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:25:11,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:11,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:11,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:25:11,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:36 [2018-09-21 18:25:11,877 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:11,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:11,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:11,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:25:11,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:24 [2018-09-21 18:25:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:12,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:12,658 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:12,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:25:12,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:25:12,661 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:25:12,662 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:25:12,662 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand 20 states. [2018-09-21 18:25:14,341 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-21 18:25:17,417 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:25:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:22,493 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2018-09-21 18:25:22,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-21 18:25:22,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2018-09-21 18:25:22,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:22,497 INFO L225 Difference]: With dead ends: 169 [2018-09-21 18:25:22,497 INFO L226 Difference]: Without dead ends: 167 [2018-09-21 18:25:22,499 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:25:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-21 18:25:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-21 18:25:22,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-21 18:25:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2018-09-21 18:25:22,516 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 52 [2018-09-21 18:25:22,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:22,516 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2018-09-21 18:25:22,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:25:22,517 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2018-09-21 18:25:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-21 18:25:22,520 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:22,520 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:22,520 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:22,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1514815398, now seen corresponding path program 1 times [2018-09-21 18:25:22,521 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:22,521 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-21 18:25:22,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:22,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:22,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:22,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:22,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:22,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:22,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:22,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:22,719 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:22,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:22,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:22,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:22,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:22,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:22,813 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:22,825 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:22,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:25:22,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:25:22,826 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:25:22,826 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:25:22,827 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand 8 states. [2018-09-21 18:25:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:25,345 INFO L93 Difference]: Finished difference Result 171 states and 208 transitions. [2018-09-21 18:25:25,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:25:25,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2018-09-21 18:25:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:25,351 INFO L225 Difference]: With dead ends: 171 [2018-09-21 18:25:25,351 INFO L226 Difference]: Without dead ends: 167 [2018-09-21 18:25:25,352 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:25:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-21 18:25:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-21 18:25:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-21 18:25:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 203 transitions. [2018-09-21 18:25:25,365 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 203 transitions. Word has length 57 [2018-09-21 18:25:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:25,365 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 203 transitions. [2018-09-21 18:25:25,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:25:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 203 transitions. [2018-09-21 18:25:25,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-21 18:25:25,368 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:25,368 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:25,369 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1005144536, now seen corresponding path program 1 times [2018-09-21 18:25:25,370 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:25,370 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:25:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-21 18:25:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:25,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:25,674 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:25:26,014 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:25:26,231 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-21 18:25:26,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:26,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:26,259 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:26,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:25:26,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:25:26,260 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:25:26,261 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:25:26,261 INFO L87 Difference]: Start difference. First operand 167 states and 203 transitions. Second operand 7 states. [2018-09-21 18:25:35,616 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:25:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:38,674 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2018-09-21 18:25:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:25:38,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-09-21 18:25:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:38,678 INFO L225 Difference]: With dead ends: 171 [2018-09-21 18:25:38,678 INFO L226 Difference]: Without dead ends: 165 [2018-09-21 18:25:38,679 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:25:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-21 18:25:38,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-21 18:25:38,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-21 18:25:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 200 transitions. [2018-09-21 18:25:38,691 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 200 transitions. Word has length 57 [2018-09-21 18:25:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:38,692 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 200 transitions. [2018-09-21 18:25:38,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:25:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 200 transitions. [2018-09-21 18:25:38,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-21 18:25:38,695 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:38,695 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:38,695 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1633972200, now seen corresponding path program 1 times [2018-09-21 18:25:38,696 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-21 18:25:38,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:38,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:38,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:38,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:38,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:38,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:38,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:38,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:38,973 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:38,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:38,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:39,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:39,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:39,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:39,301 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:39,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:39,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:25:39,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:25:39,314 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:25:39,314 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:25:39,315 INFO L87 Difference]: Start difference. First operand 165 states and 200 transitions. Second operand 9 states. [2018-09-21 18:25:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:41,600 INFO L93 Difference]: Finished difference Result 208 states and 255 transitions. [2018-09-21 18:25:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:25:41,602 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-09-21 18:25:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:41,604 INFO L225 Difference]: With dead ends: 208 [2018-09-21 18:25:41,605 INFO L226 Difference]: Without dead ends: 159 [2018-09-21 18:25:41,605 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:25:41,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-21 18:25:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-21 18:25:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-21 18:25:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2018-09-21 18:25:41,616 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 57 [2018-09-21 18:25:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:41,617 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2018-09-21 18:25:41,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:25:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2018-09-21 18:25:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-21 18:25:41,620 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:41,621 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:41,621 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:41,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1637364306, now seen corresponding path program 1 times [2018-09-21 18:25:41,622 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:41,622 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-21 18:25:41,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:41,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:41,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:41,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:41,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:41,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:41,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:41,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:41,830 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:41,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:41,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:41,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:41,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:41,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:42,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:25:42,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:25:42,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:42,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:42,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:42,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:25:42,546 INFO L477 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 29 treesize of output 21 [2018-09-21 18:25:42,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:25:42,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:25:42,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:42,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:25:42,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:25:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:42,866 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:42,879 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:42,879 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-21 18:25:42,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-21 18:25:42,880 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-21 18:25:42,880 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-21 18:25:42,881 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand 15 states. [2018-09-21 18:25:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:25:46,451 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2018-09-21 18:25:46,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-21 18:25:46,452 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-09-21 18:25:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:25:46,453 INFO L225 Difference]: With dead ends: 196 [2018-09-21 18:25:46,454 INFO L226 Difference]: Without dead ends: 148 [2018-09-21 18:25:46,454 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-09-21 18:25:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-21 18:25:46,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-21 18:25:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-21 18:25:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2018-09-21 18:25:46,464 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 58 [2018-09-21 18:25:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:25:46,465 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2018-09-21 18:25:46,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-21 18:25:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2018-09-21 18:25:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-21 18:25:46,468 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:25:46,468 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:25:46,468 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:25:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1194695140, now seen corresponding path program 1 times [2018-09-21 18:25:46,469 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:25:46,469 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-09-21 18:25:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:25:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:25:46,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:25:46,787 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:25:47,095 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:25:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:25:47,321 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:25:47,332 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:25:47,332 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:25:47,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:25:47,333 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:25:47,333 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:25:47,334 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand 7 states. [2018-09-21 18:26:03,166 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:26:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:04,507 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2018-09-21 18:26:04,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:26:04,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2018-09-21 18:26:04,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:04,511 INFO L225 Difference]: With dead ends: 152 [2018-09-21 18:26:04,512 INFO L226 Difference]: Without dead ends: 146 [2018-09-21 18:26:04,512 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:26:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-21 18:26:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-21 18:26:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-21 18:26:04,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 165 transitions. [2018-09-21 18:26:04,521 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 165 transitions. Word has length 59 [2018-09-21 18:26:04,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:04,521 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 165 transitions. [2018-09-21 18:26:04,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:26:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 165 transitions. [2018-09-21 18:26:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-21 18:26:04,527 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:04,527 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:26:04,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:04,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1400643683, now seen corresponding path program 1 times [2018-09-21 18:26:04,531 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:04,531 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-09-21 18:26:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:04,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:04,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:26:04,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:26:04,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:04,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:04,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:04,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:26:04,790 INFO L477 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 29 treesize of output 21 [2018-09-21 18:26:04,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:26:04,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:04,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:04,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:04,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:26:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:26:04,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:26:04,980 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:26:04,980 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:26:04,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:26:04,981 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:26:04,981 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:26:04,981 INFO L87 Difference]: Start difference. First operand 146 states and 165 transitions. Second operand 9 states. [2018-09-21 18:26:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:06,094 INFO L93 Difference]: Finished difference Result 148 states and 166 transitions. [2018-09-21 18:26:06,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-21 18:26:06,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-09-21 18:26:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:06,097 INFO L225 Difference]: With dead ends: 148 [2018-09-21 18:26:06,097 INFO L226 Difference]: Without dead ends: 110 [2018-09-21 18:26:06,097 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:26:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-21 18:26:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-21 18:26:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-21 18:26:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-09-21 18:26:06,102 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 60 [2018-09-21 18:26:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:06,103 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-09-21 18:26:06,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:26:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2018-09-21 18:26:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-21 18:26:06,104 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:06,104 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:26:06,106 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1937904289, now seen corresponding path program 1 times [2018-09-21 18:26:06,107 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:06,107 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-09-21 18:26:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:06,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:06,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:26:06,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:26:06,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:06,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:06,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:06,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:26:06,326 INFO L477 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 29 treesize of output 21 [2018-09-21 18:26:06,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:26:06,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:06,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:06,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:06,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:26:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:26:06,603 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:26:06,614 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:26:06,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:26:06,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:26:06,615 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:26:06,615 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:26:06,616 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 11 states. [2018-09-21 18:26:22,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:22,463 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2018-09-21 18:26:22,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:26:22,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2018-09-21 18:26:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:22,520 INFO L225 Difference]: With dead ends: 119 [2018-09-21 18:26:22,520 INFO L226 Difference]: Without dead ends: 114 [2018-09-21 18:26:22,521 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:26:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-21 18:26:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-09-21 18:26:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-21 18:26:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-09-21 18:26:22,526 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 71 [2018-09-21 18:26:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:22,527 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-09-21 18:26:22,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:26:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-09-21 18:26:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-21 18:26:22,532 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:22,533 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:26:22,533 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash -533955026, now seen corresponding path program 1 times [2018-09-21 18:26:22,535 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:22,535 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-09-21 18:26:22,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:22,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:22,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:26:22,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:26:22,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:22,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:22,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:22,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:26:22,894 INFO L477 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 29 treesize of output 21 [2018-09-21 18:26:22,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:26:22,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:26:22,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:22,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:26:22,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:26:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:26:23,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:26:23,050 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:26:23,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:26:23,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:26:23,051 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:26:23,051 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:26:23,051 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 10 states. [2018-09-21 18:26:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:26:36,079 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-09-21 18:26:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:26:36,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-09-21 18:26:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:26:36,135 INFO L225 Difference]: With dead ends: 118 [2018-09-21 18:26:36,135 INFO L226 Difference]: Without dead ends: 113 [2018-09-21 18:26:36,136 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:26:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-21 18:26:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-09-21 18:26:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-21 18:26:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-09-21 18:26:36,141 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 72 [2018-09-21 18:26:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:26:36,141 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-09-21 18:26:36,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:26:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-09-21 18:26:36,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-21 18:26:36,144 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:26:36,144 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:26:36,144 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:26:36,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1273499437, now seen corresponding path program 1 times [2018-09-21 18:26:36,146 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:26:36,146 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-09-21 18:26:36,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:26:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:26:36,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:26:38,310 INFO L303 Elim1Store]: Index analysis took 2021 ms [2018-09-21 18:26:38,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 31 treesize of output 34 [2018-09-21 18:26:42,369 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 37748947079.0 1000000000000000000.0))) (select v_arrayElimArr_1 (_ bv0 32))) [2018-09-21 18:26:42,371 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:42,373 INFO L303 Elim1Store]: Index analysis took 4060 ms [2018-09-21 18:26:42,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-09-21 18:26:44,798 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:46,009 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:48,024 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 3447321717.0 100000000000000000.0))) (select v_arrayElimArr_2 (_ bv0 32))) [2018-09-21 18:26:48,025 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:48,028 INFO L303 Elim1Store]: Index analysis took 5652 ms [2018-09-21 18:26:48,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 76 [2018-09-21 18:26:49,749 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:50,338 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:52,318 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:52,754 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:53,712 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:55,718 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= ((_ to_fp 8 24) RNE ((_ to_fp 11 53) RNE (/ 75497894159.0 1000000000000000000.0))) (select v_arrayElimArr_3 (_ bv2 32))) [2018-09-21 18:26:55,719 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:26:55,722 INFO L303 Elim1Store]: Index analysis took 7690 ms [2018-09-21 18:26:55,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 121 [2018-09-21 18:26:55,724 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:04,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:07,511 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:15,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:22,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 31 treesize of output 34 [2018-09-21 18:27:22,958 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:22,960 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-09-21 18:27:22,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-09-21 18:27:23,214 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,373 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,693 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,696 INFO L303 Elim1Store]: Index analysis took 733 ms [2018-09-21 18:27:23,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 76 [2018-09-21 18:27:23,799 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,829 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,880 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,930 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:23,979 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:24,053 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:24,055 INFO L303 Elim1Store]: Index analysis took 356 ms [2018-09-21 18:27:24,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 121 [2018-09-21 18:27:24,057 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:24,186 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:24,258 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:24,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:24,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:24,477 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:70, output treesize:80 [2018-09-21 18:27:24,642 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-21 18:27:25,100 WARN L178 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-21 18:27:25,702 WARN L178 SmtUtils]: Spent 475.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-21 18:27:26,368 WARN L178 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-21 18:27:26,388 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,392 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,398 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,403 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,409 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,414 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2018-09-21 18:27:26,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:26,658 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,659 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,661 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,663 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,665 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,666 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:27:26,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 63 [2018-09-21 18:27:26,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:26,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:26,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:22 [2018-09-21 18:27:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:27:26,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:27:26,922 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:27:26,922 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:27:26,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:27:26,923 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:27:26,923 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:27:26,923 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 8 states. [2018-09-21 18:27:41,634 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-21 18:27:41,939 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-09-21 18:27:42,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:27:42,084 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-09-21 18:27:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-21 18:27:42,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-09-21 18:27:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:27:42,088 INFO L225 Difference]: With dead ends: 119 [2018-09-21 18:27:42,088 INFO L226 Difference]: Without dead ends: 110 [2018-09-21 18:27:42,089 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:27:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-21 18:27:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-09-21 18:27:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-21 18:27:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2018-09-21 18:27:42,093 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 72 [2018-09-21 18:27:42,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:27:42,093 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2018-09-21 18:27:42,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:27:42,093 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2018-09-21 18:27:42,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-21 18:27:42,095 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:27:42,095 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:27:42,098 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:27:42,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2040063844, now seen corresponding path program 1 times [2018-09-21 18:27:42,099 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:27:42,099 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-09-21 18:27:42,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:27:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:27:42,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:27:42,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:27:42,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:27:42,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:42,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:42,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:42,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:27:42,336 INFO L477 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 29 treesize of output 21 [2018-09-21 18:27:42,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:27:42,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:42,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:42,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:42,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:27:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:27:42,551 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:27:42,563 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:27:42,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:27:42,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:27:42,564 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:27:42,564 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:27:42,564 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 11 states. [2018-09-21 18:27:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:27:55,519 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-09-21 18:27:55,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-21 18:27:55,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-09-21 18:27:55,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:27:55,574 INFO L225 Difference]: With dead ends: 114 [2018-09-21 18:27:55,575 INFO L226 Difference]: Without dead ends: 109 [2018-09-21 18:27:55,575 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:27:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-21 18:27:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-09-21 18:27:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-21 18:27:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-09-21 18:27:55,579 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 73 [2018-09-21 18:27:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:27:55,580 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-09-21 18:27:55,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:27:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-09-21 18:27:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-21 18:27:55,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:27:55,581 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:27:55,581 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:27:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash -347725818, now seen corresponding path program 1 times [2018-09-21 18:27:55,585 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:27:55,585 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) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:27:55,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:27:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:27:56,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:27:56,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:27:56,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:27:56,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:56,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:56,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:56,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:27:56,885 INFO L477 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 29 treesize of output 21 [2018-09-21 18:27:56,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:27:56,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:27:56,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:56,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:27:56,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:27:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:27:57,157 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:27:57,190 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:27:57,191 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:27:57,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:27:57,192 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:27:57,192 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:27:57,192 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 11 states. [2018-09-21 18:28:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:10,110 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-09-21 18:28:10,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:28:10,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-09-21 18:28:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:10,113 INFO L225 Difference]: With dead ends: 118 [2018-09-21 18:28:10,113 INFO L226 Difference]: Without dead ends: 104 [2018-09-21 18:28:10,113 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:28:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-21 18:28:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-21 18:28:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-21 18:28:10,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-09-21 18:28:10,117 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 75 [2018-09-21 18:28:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:10,117 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-09-21 18:28:10,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:28:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-09-21 18:28:10,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-21 18:28:10,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:10,119 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:28:10,119 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:10,119 INFO L82 PathProgramCache]: Analyzing trace with hash 353323623, now seen corresponding path program 1 times [2018-09-21 18:28:10,123 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:10,123 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-09-21 18:28:10,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:11,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:11,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 8 [2018-09-21 18:28:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:11,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:11,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:11,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:11,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:11,671 INFO L477 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 29 treesize of output 21 [2018-09-21 18:28:11,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:11,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:11,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:11,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:11,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:28:11,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:11,983 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:11,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 18:28:11,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 18:28:11,984 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 18:28:11,984 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-21 18:28:11,984 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 11 states. [2018-09-21 18:28:27,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:27,709 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-09-21 18:28:27,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 18:28:27,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-09-21 18:28:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:27,712 INFO L225 Difference]: With dead ends: 106 [2018-09-21 18:28:27,712 INFO L226 Difference]: Without dead ends: 0 [2018-09-21 18:28:27,712 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:28:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-21 18:28:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-21 18:28:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-21 18:28:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-21 18:28:27,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2018-09-21 18:28:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:27,715 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-21 18:28:27,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 18:28:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-21 18:28:27,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-21 18:28:27,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 06:28:27 BoogieIcfgContainer [2018-09-21 18:28:27,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-21 18:28:27,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-21 18:28:27,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-21 18:28:27,724 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-21 18:28:27,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:25:09" (3/4) ... [2018-09-21 18:28:27,728 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-21 18:28:27,736 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-21 18:28:27,736 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2018-09-21 18:28:27,736 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __ieee754_atan2f [2018-09-21 18:28:27,736 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isfinite_float [2018-09-21 18:28:27,737 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-21 18:28:27,737 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2018-09-21 18:28:27,747 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-09-21 18:28:27,749 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-09-21 18:28:27,750 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-09-21 18:28:27,865 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-21 18:28:27,869 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-21 18:28:27,871 INFO L168 Benchmark]: Toolchain (without parser) took 214357.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 953.2 MB in the beginning and 994.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 255.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:27,876 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:28:27,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.12 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:27,877 INFO L168 Benchmark]: Boogie Preprocessor took 118.68 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:27,878 INFO L168 Benchmark]: RCFGBuilder took 15151.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:27,878 INFO L168 Benchmark]: TraceAbstraction took 198426.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.3 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:27,878 INFO L168 Benchmark]: Witness Printer took 146.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 994.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-09-21 18:28:27,884 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.38 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 505.12 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 118.68 ms. Allocated memory is still 1.0 GB. Free memory was 937.1 MB in the beginning and 931.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 15151.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 931.7 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198426.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 150.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 75.3 MB). Peak memory consumption was 225.8 MB. Max. memory is 11.5 GB. * Witness Printer took 146.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 994.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 244]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 172 locations, 1 error locations. SAFE Result, 198.3s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 134.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2116 SDtfs, 2113 SDslu, 12768 SDs, 0 SdLazy, 2427 SolverSat, 123 SolverUnsat, 31 SolverUnknown, 0 SolverNotchecked, 121.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 976 GetRequests, 761 SyntacticMatches, 3 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 16.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 59.1s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 875 ConstructedInterpolants, 109 QuantifiedInterpolants, 764615 SizeOfPredicates, 113 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...