/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 40ef5092 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a57138b2f10668d31b1e3de2f5b5c701f65e7c4 ............................................................................................................................................................................................................................................................................................................................................................................................ 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/double_req_bl_1231b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a57138b2f10668d31b1e3de2f5b5c701f65e7c4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-40ef509 [2018-09-20 15:05:46,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:05:46,349 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:05:46,366 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:05:46,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:05:46,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:05:46,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:05:46,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:05:46,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:05:46,386 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:05:46,387 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:05:46,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:05:46,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:05:46,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:05:46,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:05:46,397 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:05:46,398 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:05:46,403 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:05:46,405 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:05:46,409 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:05:46,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:05:46,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:05:46,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:05:46,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:05:46,423 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:05:46,424 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:05:46,425 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:05:46,428 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:05:46,429 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:05:46,432 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:05:46,433 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:05:46,434 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:05:46,434 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:05:46,434 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:05:46,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:05:46,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:05:46,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-20 15:05:46,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:05:46,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:05:46,468 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:05:46,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:05:46,469 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:05:46,470 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:05:46,471 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:05:46,471 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:05:46,471 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:05:46,471 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-20 15:05:46,471 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:05:46,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:05:46,472 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:05:46,472 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:05:46,472 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:05:46,472 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:05:46,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:05:46,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:05:46,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:05:46,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:05:46,476 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:05:46,476 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:05:46,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:46,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:05:46,477 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:05:46,477 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:05:46,477 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-20 15:05:46,477 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:05:46,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-20 15:05:46,479 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 -> 3a57138b2f10668d31b1e3de2f5b5c701f65e7c4 [2018-09-20 15:05:46,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:05:46,591 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:05:46,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:05:46,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:05:46,597 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:05:46,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-09-20 15:05:46,952 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0edb178/8a94ee9688ed48a99f679b8461a4bb84/FLAG873900e35 [2018-09-20 15:05:47,092 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:05:47,093 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-09-20 15:05:47,102 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0edb178/8a94ee9688ed48a99f679b8461a4bb84/FLAG873900e35 [2018-09-20 15:05:47,119 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa0edb178/8a94ee9688ed48a99f679b8461a4bb84 [2018-09-20 15:05:47,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:05:47,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:05:47,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:47,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:05:47,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:05:47,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63751dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47, skipping insertion in model container [2018-09-20 15:05:47,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,152 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:05:47,361 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:47,379 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:05:47,396 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:47,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47 WrapperNode [2018-09-20 15:05:47,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:47,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:05:47,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:05:47,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:05:47,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,462 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (1/1) ... [2018-09-20 15:05:47,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:05:47,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:05:47,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:05:47,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:05:47,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05: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-20 15:05:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:05:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:05:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:05:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:05:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-20 15:05:47,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:05:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:05:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:05:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:05:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:05:47,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:05:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-09-20 15:05:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-09-20 15:05:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:05:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-20 15:05:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:05:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:05:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:05:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-09-20 15:05:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-09-20 15:05:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2018-09-20 15:05:47,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-09-20 15:05:48,275 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:05:48,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:48 BoogieIcfgContainer [2018-09-20 15:05:48,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:05:48,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:05:48,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:05:48,280 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:05:48,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:05:47" (1/3) ... [2018-09-20 15:05:48,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443cede2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:48, skipping insertion in model container [2018-09-20 15:05:48,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:47" (2/3) ... [2018-09-20 15:05:48,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443cede2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:48, skipping insertion in model container [2018-09-20 15:05:48,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:48" (3/3) ... [2018-09-20 15:05:48,284 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2018-09-20 15:05:48,295 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:05:48,304 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:05:48,360 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:05:48,361 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:05:48,362 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:05:48,362 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:05:48,362 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:05:48,362 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:05:48,362 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:05:48,363 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:05:48,363 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:05:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-09-20 15:05:48,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-20 15:05:48,399 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:48,402 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] [2018-09-20 15:05:48,411 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:48,419 INFO L82 PathProgramCache]: Analyzing trace with hash -770504903, now seen corresponding path program 1 times [2018-09-20 15:05:48,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:48,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:48,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:48,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:48,640 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:48,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:05:48,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:05:48,662 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:05:48,663 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:48,665 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-09-20 15:05:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:48,694 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-09-20 15:05:48,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:05:48,698 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-20 15:05:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:48,711 INFO L225 Difference]: With dead ends: 93 [2018-09-20 15:05:48,711 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:48,716 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:05:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-09-20 15:05:48,774 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2018-09-20 15:05:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:48,774 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-09-20 15:05:48,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:05:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-09-20 15:05:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:05:48,782 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:48,782 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] [2018-09-20 15:05:48,783 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:48,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1107593466, now seen corresponding path program 1 times [2018-09-20 15:05:48,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:48,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:48,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:48,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:49,067 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:49,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:49,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:49,071 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:49,071 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:49,072 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-09-20 15:05:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:49,181 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-09-20 15:05:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:49,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:05:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:49,188 INFO L225 Difference]: With dead ends: 59 [2018-09-20 15:05:49,189 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 15:05:49,191 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 15:05:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-20 15:05:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:05:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:05:49,203 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 40 [2018-09-20 15:05:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:49,204 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:05:49,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:05:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:05:49,206 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:49,206 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] [2018-09-20 15:05:49,206 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:49,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1793310220, now seen corresponding path program 1 times [2018-09-20 15:05:49,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:49,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:49,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:49,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:49,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:49,353 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:49,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:49,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:49,354 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:49,354 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:49,355 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 4 states. [2018-09-20 15:05:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:49,443 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-09-20 15:05:49,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:49,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-09-20 15:05:49,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:49,449 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:05:49,449 INFO L226 Difference]: Without dead ends: 57 [2018-09-20 15:05:49,451 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-20 15:05:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-09-20 15:05:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:05:49,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-09-20 15:05:49,469 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 43 [2018-09-20 15:05:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:49,469 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-09-20 15:05:49,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-09-20 15:05:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-20 15:05:49,472 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:49,472 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] [2018-09-20 15:05:49,473 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1596796715, now seen corresponding path program 1 times [2018-09-20 15:05:49,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-20 15:05:49,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-20 15:05:49,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:49,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:49,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-20 15:05:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:05:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-09-20 15:05:49,584 INFO L443 BasicCegarLoop]: Counterexample might be feasible [2018-09-20 15:05:49,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:05:49 BoogieIcfgContainer [2018-09-20 15:05:49,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:05:49,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:05:49,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:05:49,628 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:05:49,630 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:48" (3/4) ... [2018-09-20 15:05:49,634 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-09-20 15:05:49,634 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:05:49,635 INFO L168 Benchmark]: Toolchain (without parser) took 2510.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -126.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:49,637 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:49,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 938.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:49,639 INFO L168 Benchmark]: Boogie Preprocessor took 47.44 ms. Allocated memory is still 1.0 GB. Free memory was 938.4 MB in the beginning and 933.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:49,640 INFO L168 Benchmark]: RCFGBuilder took 803.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:49,641 INFO L168 Benchmark]: TraceAbstraction took 1350.52 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2018-09-20 15:05:49,642 INFO L168 Benchmark]: Witness Printer took 6.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:05:49,649 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 296.94 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 938.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.44 ms. Allocated memory is still 1.0 GB. Free memory was 938.4 MB in the beginning and 933.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 803.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1350.52 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: 48.2 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.75 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: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; VAL [x=4294967302] [L62] CALL, EXPR isnan_double(x) VAL [\old(x)=4294967302] [L16] RET return x != x; VAL [\old(x)=4294967302, \result=0, x=4294967302] [L62] EXPR isnan_double(x) VAL [isnan_double(x)=0, x=4294967302] [L62] COND TRUE !isnan_double(x) [L64] CALL, EXPR fmin_double(x, y) VAL [\old(x)=4294967302, \old(y)=4294967300] [L45] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967302] [L18] __uint32_t msw, lsw; VAL [\old(x)=4294967302, x=4294967302] [L21] FCALL ieee_double_shape_type ew_u; VAL [\old(x)=4294967302, ew_u={4294967299:0}, x=4294967302] [L22] FCALL ew_u.value = (x) VAL [\old(x)=4294967302, ew_u={4294967299:0}, x=4294967302] [L23] EXPR, FCALL ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, x=4294967302] [L23] (msw) = ew_u.parts.msw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967302] [L23] FCALL (msw) = ew_u.parts.msw VAL [(msw) = ew_u.parts.msw=4294967301, \old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.msw=4293918721, msw=4293918721, x=4294967302] [L24] EXPR, FCALL ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, msw=4293918721, x=4294967302] [L24] (lsw) = ew_u.parts.lsw VAL [\old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967302] [L24] FCALL (lsw) = ew_u.parts.lsw VAL [(lsw) = ew_u.parts.lsw=4294967304, \old(x)=4294967302, ew_u={4294967299:0}, ew_u.parts.lsw=4294967297, lsw=4294967297, msw=4293918721, x=4294967302] [L25] COND FALSE !(0) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L33-L34] COND FALSE !((msw >= 0x00000000 && msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967302, lsw=4294967297, msw=4293918721, x=4294967302] [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] RET return 0; VAL [\old(x)=4294967302, \result=0, lsw=4294967297, msw=4293918721, x=4294967302] [L45] EXPR __fpclassify_double(x) VAL [\old(x)=4294967302, \old(y)=4294967300, __fpclassify_double(x)=0, x=4294967302, y=4294967300] [L45] COND TRUE __fpclassify_double(x) == 0 [L46] RET return y; VAL [\old(x)=4294967302, \old(y)=4294967300, \result=4294967300, x=4294967302, y=4294967300] [L64] EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4294967300, x=4294967302, y=4294967300] [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x VAL [res=4294967300, x=4294967302, y=4294967300] [L68] __VERIFIER_error() VAL [res=4294967300, x=4294967302, y=4294967300] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 0 SDslu, 210 SDs, 0 SdLazy, 21 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 4609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-40ef509 [2018-09-20 15:05:52,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-20 15:05:52,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-20 15:05:52,156 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-20 15:05:52,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-20 15:05:52,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-20 15:05:52,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-20 15:05:52,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-20 15:05:52,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-20 15:05:52,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-20 15:05:52,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-20 15:05:52,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-20 15:05:52,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-20 15:05:52,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-20 15:05:52,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-20 15:05:52,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-20 15:05:52,172 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-20 15:05:52,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-20 15:05:52,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-20 15:05:52,179 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-20 15:05:52,180 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-20 15:05:52,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-20 15:05:52,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-20 15:05:52,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-20 15:05:52,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-20 15:05:52,189 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-20 15:05:52,190 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-20 15:05:52,191 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-20 15:05:52,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-20 15:05:52,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-20 15:05:52,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-20 15:05:52,200 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-20 15:05:52,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-20 15:05:52,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-20 15:05:52,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-20 15:05:52,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-20 15:05:52,204 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-20 15:05:52,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-20 15:05:52,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-20 15:05:52,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-20 15:05:52,222 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-20 15:05:52,222 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-20 15:05:52,223 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-20 15:05:52,223 INFO L133 SettingsManager]: * Use SBE=true [2018-09-20 15:05:52,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-20 15:05:52,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-20 15:05:52,224 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-20 15:05:52,224 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-20 15:05:52,224 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-20 15:05:52,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-20 15:05:52,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-20 15:05:52,224 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-20 15:05:52,225 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-20 15:05:52,225 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-20 15:05:52,225 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-20 15:05:52,225 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-20 15:05:52,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-20 15:05:52,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-20 15:05:52,228 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-20 15:05:52,228 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-20 15:05:52,228 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:52,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-20 15:05:52,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-20 15:05:52,229 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-20 15:05:52,229 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-20 15:05:52,229 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-20 15:05:52,229 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-20 15:05:52,229 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-20 15:05:52,230 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 -> 3a57138b2f10668d31b1e3de2f5b5c701f65e7c4 [2018-09-20 15:05:52,284 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-20 15:05:52,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-20 15:05:52,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-20 15:05:52,304 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-20 15:05:52,304 INFO L276 PluginConnector]: CDTParser initialized [2018-09-20 15:05:52,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-09-20 15:05:52,681 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164983ed0/aa3d70964d294158b7a8a2e013801681/FLAGb1ce10947 [2018-09-20 15:05:52,903 INFO L277 CDTParser]: Found 1 translation units. [2018-09-20 15:05:52,904 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1231b_true-unreach-call.c [2018-09-20 15:05:52,913 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164983ed0/aa3d70964d294158b7a8a2e013801681/FLAGb1ce10947 [2018-09-20 15:05:52,934 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/164983ed0/aa3d70964d294158b7a8a2e013801681 [2018-09-20 15:05:52,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-20 15:05:52,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-20 15:05:52,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:52,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-20 15:05:52,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-20 15:05:52,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:52" (1/1) ... [2018-09-20 15:05:52,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461d06e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:52, skipping insertion in model container [2018-09-20 15:05:52,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 03:05:52" (1/1) ... [2018-09-20 15:05:52,975 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-20 15:05:53,206 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:53,227 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-20 15:05:53,245 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-20 15:05:53,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53 WrapperNode [2018-09-20 15:05:53,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-20 15:05:53,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-20 15:05:53,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-20 15:05:53,290 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-20 15:05:53,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... [2018-09-20 15:05:53,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-20 15:05:53,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-20 15:05:53,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-20 15:05:53,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-20 15:05:53,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-20 15:05:53,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-20 15:05:53,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-20 15:05:53,567 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-09-20 15:05:53,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-09-20 15:05:53,567 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-09-20 15:05:53,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-20 15:05:53,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-20 15:05:53,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-20 15:05:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-09-20 15:05:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-09-20 15:05:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-20 15:05:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-20 15:05:53,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-20 15:05:53,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-20 15:05:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-09-20 15:05:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-20 15:05:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-20 15:05:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-20 15:05:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-20 15:05:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-20 15:05:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-20 15:05:53,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-20 15:05:53,936 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:53,983 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:54,030 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-20 15:05:54,178 INFO L365 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-20 15:05:54,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:54 BoogieIcfgContainer [2018-09-20 15:05:54,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-20 15:05:54,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-20 15:05:54,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-20 15:05:54,188 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-20 15:05:54,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 03:05:52" (1/3) ... [2018-09-20 15:05:54,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e31ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:54, skipping insertion in model container [2018-09-20 15:05:54,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 03:05:53" (2/3) ... [2018-09-20 15:05:54,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28e31ad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 03:05:54, skipping insertion in model container [2018-09-20 15:05:54,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:54" (3/3) ... [2018-09-20 15:05:54,195 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2018-09-20 15:05:54,207 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-20 15:05:54,218 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-20 15:05:54,266 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-20 15:05:54,266 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-20 15:05:54,267 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-20 15:05:54,267 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-20 15:05:54,267 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-20 15:05:54,267 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-20 15:05:54,269 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-20 15:05:54,269 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-20 15:05:54,269 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-20 15:05:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-09-20 15:05:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-20 15:05:54,298 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:54,299 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-20 15:05:54,301 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -883733309, now seen corresponding path program 1 times [2018-09-20 15:05:54,312 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:54,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:54,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:54,422 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:54,441 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:54,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-20 15:05:54,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-20 15:05:54,460 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-20 15:05:54,462 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-20 15:05:54,465 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-09-20 15:05:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:54,494 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2018-09-20 15:05:54,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-20 15:05:54,496 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-09-20 15:05:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:54,508 INFO L225 Difference]: With dead ends: 88 [2018-09-20 15:05:54,508 INFO L226 Difference]: Without dead ends: 46 [2018-09-20 15:05:54,513 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-20 15:05:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-20 15:05:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-20 15:05:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-20 15:05:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-09-20 15:05:54,568 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 25 [2018-09-20 15:05:54,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:54,568 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-09-20 15:05:54,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-20 15:05:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-09-20 15:05:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-20 15:05:54,572 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:54,572 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] [2018-09-20 15:05:54,572 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:54,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2016097883, now seen corresponding path program 1 times [2018-09-20 15:05:54,574 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:54,574 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) [2018-09-20 15:05:54,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:54,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:54,752 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:54,766 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:54,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:54,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:54,770 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:54,770 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:54,770 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 4 states. [2018-09-20 15:05:54,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:54,852 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-09-20 15:05:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:54,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-09-20 15:05:54,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:54,857 INFO L225 Difference]: With dead ends: 55 [2018-09-20 15:05:54,857 INFO L226 Difference]: Without dead ends: 49 [2018-09-20 15:05:54,858 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-20 15:05:54,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-20 15:05:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:54,870 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 38 [2018-09-20 15:05:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:54,871 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:54,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-20 15:05:54,874 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:54,874 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] [2018-09-20 15:05:54,875 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1374149908, now seen corresponding path program 1 times [2018-09-20 15:05:54,876 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:54,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:55,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:55,064 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:55,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:55,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:55,065 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:55,066 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,066 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:05:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:55,167 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:05:55,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:55,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-09-20 15:05:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:55,171 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:55,171 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:55,172 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:55,183 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 39 [2018-09-20 15:05:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:55,183 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:55,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-20 15:05:55,185 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:55,185 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] [2018-09-20 15:05:55,185 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1588482423, now seen corresponding path program 1 times [2018-09-20 15:05:55,186 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:55,187 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) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:55,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:55,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:55,425 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:55,440 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:55,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:55,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:55,442 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:55,442 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,442 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:05:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:55,657 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:05:55,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:55,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-09-20 15:05:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:55,662 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:55,662 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:55,663 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:55,681 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 40 [2018-09-20 15:05:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:55,682 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:55,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:55,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:05:55,689 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:55,690 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] [2018-09-20 15:05:55,690 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:55,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1717260944, now seen corresponding path program 1 times [2018-09-20 15:05:55,691 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:55,691 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:55,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:55,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:55,902 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:55,915 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:55,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:05:55,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:05:55,916 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:05:55,916 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,916 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 4 states. [2018-09-20 15:05:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:05:55,977 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-09-20 15:05:55,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:05:55,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-09-20 15:05:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:05:55,980 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:05:55,980 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:05:55,981 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:05:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:05:55,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-09-20 15:05:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-20 15:05:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-09-20 15:05:55,989 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 41 [2018-09-20 15:05:55,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:05:55,990 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2018-09-20 15:05:55,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:05:55,990 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-09-20 15:05:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-20 15:05:55,992 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:05:55,992 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] [2018-09-20 15:05:55,993 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:05:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash -90193519, now seen corresponding path program 1 times [2018-09-20 15:05:55,993 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:05:55,994 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-20 15:05:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:05:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:05:56,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:05:56,345 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-20 15:05:56,636 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:05:56,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:05:56,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-20 15:05:56,669 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:56,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:05:56,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:56,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:56,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:05:57,506 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:05:57,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:05:57,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-20 15:05:57,525 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:57,629 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-09-20 15:05:57,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:05:57,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:57,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:57,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:05:57,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:05:57,968 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 35 treesize of output 27 [2018-09-20 15:05:57,976 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:05:57,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:05:57,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:05:57,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:05:58,012 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-20 15:05:58,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:05:58,533 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-09-20 15:05:58,848 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2018-09-20 15:05:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-20 15:05:59,311 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:05:59,326 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:05:59,326 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-20 15:05:59,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-20 15:05:59,327 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-20 15:05:59,327 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-20 15:05:59,328 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand 16 states. [2018-09-20 15:05:59,962 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:06:00,858 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:06:01,478 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-20 15:06:06,583 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2018-09-20 15:06:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:07,274 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2018-09-20 15:06:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-20 15:06:07,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-09-20 15:06:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:07,289 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:06:07,289 INFO L226 Difference]: Without dead ends: 52 [2018-09-20 15:06:07,290 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-09-20 15:06:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-20 15:06:07,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-09-20 15:06:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 15:06:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-09-20 15:06:07,299 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 41 [2018-09-20 15:06:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:07,299 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-09-20 15:06:07,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-20 15:06:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-09-20 15:06:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-20 15:06:07,302 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:07,302 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 15:06:07,303 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:07,303 INFO L82 PathProgramCache]: Analyzing trace with hash -429778258, now seen corresponding path program 1 times [2018-09-20 15:06:07,304 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:07,304 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) [2018-09-20 15:06:07,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:07,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:07,484 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:07,496 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:07,496 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:07,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:07,498 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:07,498 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:07,499 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-09-20 15:06:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:07,526 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-09-20 15:06:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:07,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-09-20 15:06:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:07,528 INFO L225 Difference]: With dead ends: 57 [2018-09-20 15:06:07,529 INFO L226 Difference]: Without dead ends: 51 [2018-09-20 15:06:07,529 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-20 15:06:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-20 15:06:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-09-20 15:06:07,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 58 [2018-09-20 15:06:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:07,538 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-09-20 15:06:07,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-09-20 15:06:07,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-20 15:06:07,540 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:07,540 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-20 15:06:07,541 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1152900451, now seen corresponding path program 1 times [2018-09-20 15:06:07,541 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:07,542 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-20 15:06:07,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:07,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:07,700 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:07,712 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:07,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:07,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:07,713 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:07,713 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:07,713 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 4 states. [2018-09-20 15:06:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:07,738 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-09-20 15:06:07,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:07,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-09-20 15:06:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:07,740 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:07,740 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:07,742 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:07,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-20 15:06:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-09-20 15:06:07,749 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 59 [2018-09-20 15:06:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:07,749 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-09-20 15:06:07,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-09-20 15:06:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:07,752 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:07,753 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-20 15:06:07,753 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash 831452585, now seen corresponding path program 1 times [2018-09-20 15:06:07,753 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:07,754 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-20 15:06:07,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:07,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:06:08,035 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:08,047 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:08,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-20 15:06:08,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-20 15:06:08,048 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-20 15:06:08,048 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-20 15:06:08,049 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 5 states. [2018-09-20 15:06:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:08,327 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-09-20 15:06:08,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-20 15:06:08,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-09-20 15:06:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:08,329 INFO L225 Difference]: With dead ends: 58 [2018-09-20 15:06:08,329 INFO L226 Difference]: Without dead ends: 51 [2018-09-20 15:06:08,330 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-20 15:06:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-20 15:06:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-20 15:06:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-09-20 15:06:08,336 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 60 [2018-09-20 15:06:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:08,336 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-09-20 15:06:08,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-20 15:06:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-09-20 15:06:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:08,339 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:08,339 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-20 15:06:08,339 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1688507349, now seen corresponding path program 1 times [2018-09-20 15:06:08,340 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:08,340 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) [2018-09-20 15:06:08,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:08,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:08,700 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 14 treesize of output 11 [2018-09-20 15:06:08,707 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 11 treesize of output 10 [2018-09-20 15:06:08,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:08,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:08,864 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 20 treesize of output 16 [2018-09-20 15:06:08,871 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 16 treesize of output 4 [2018-09-20 15:06:08,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:08,885 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-20 15:06:08,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:09,389 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:09,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:09,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:09,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:09,407 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:09,407 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:09,408 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 10 states. [2018-09-20 15:06:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:11,406 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-09-20 15:06:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:11,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-09-20 15:06:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:11,410 INFO L225 Difference]: With dead ends: 62 [2018-09-20 15:06:11,410 INFO L226 Difference]: Without dead ends: 53 [2018-09-20 15:06:11,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:06:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-20 15:06:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-20 15:06:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:11,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-09-20 15:06:11,423 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 60 [2018-09-20 15:06:11,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:11,423 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-09-20 15:06:11,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-09-20 15:06:11,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-20 15:06:11,424 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:11,424 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-20 15:06:11,424 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash -734735214, now seen corresponding path program 1 times [2018-09-20 15:06:11,425 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:11,425 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-20 15:06:11,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:11,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:11,561 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:11,573 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:11,573 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:11,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:11,573 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:11,574 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:11,574 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 4 states. [2018-09-20 15:06:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:11,618 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-09-20 15:06:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:11,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-09-20 15:06:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:11,620 INFO L225 Difference]: With dead ends: 62 [2018-09-20 15:06:11,620 INFO L226 Difference]: Without dead ends: 56 [2018-09-20 15:06:11,620 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-20 15:06:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-09-20 15:06:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-09-20 15:06:11,628 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 60 [2018-09-20 15:06:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:11,628 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-09-20 15:06:11,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-09-20 15:06:11,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:11,630 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:11,630 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-20 15:06:11,631 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:11,631 INFO L82 PathProgramCache]: Analyzing trace with hash -824232870, now seen corresponding path program 1 times [2018-09-20 15:06:11,631 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:11,632 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-20 15:06:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:11,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:11,820 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 14 treesize of output 11 [2018-09-20 15:06:11,827 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 11 treesize of output 10 [2018-09-20 15:06:11,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:11,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:11,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:11,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:11,911 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 20 treesize of output 16 [2018-09-20 15:06:11,916 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 16 treesize of output 4 [2018-09-20 15:06:11,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:11,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:11,937 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-20 15:06:11,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:12,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:12,299 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:12,299 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:12,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:12,300 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:12,300 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:12,300 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 10 states. [2018-09-20 15:06:13,072 WARN L178 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-20 15:06:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:14,256 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-09-20 15:06:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:14,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 61 [2018-09-20 15:06:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:14,259 INFO L225 Difference]: With dead ends: 64 [2018-09-20 15:06:14,259 INFO L226 Difference]: Without dead ends: 55 [2018-09-20 15:06:14,260 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:06:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-20 15:06:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-09-20 15:06:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-20 15:06:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-09-20 15:06:14,267 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 61 [2018-09-20 15:06:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:14,268 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-09-20 15:06:14,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-09-20 15:06:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:14,269 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:14,269 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-20 15:06:14,269 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:14,270 INFO L82 PathProgramCache]: Analyzing trace with hash 703601985, now seen corresponding path program 1 times [2018-09-20 15:06:14,270 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:14,270 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-20 15:06:14,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:14,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:14,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:14,405 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:14,405 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:14,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:14,405 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:14,406 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:14,406 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 4 states. [2018-09-20 15:06:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:14,431 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-09-20 15:06:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:14,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-09-20 15:06:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:14,433 INFO L225 Difference]: With dead ends: 60 [2018-09-20 15:06:14,433 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:14,433 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-09-20 15:06:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-20 15:06:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-09-20 15:06:14,438 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 61 [2018-09-20 15:06:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:14,438 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-09-20 15:06:14,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:14,439 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-09-20 15:06:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-20 15:06:14,441 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:14,442 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-20 15:06:14,442 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1103852478, now seen corresponding path program 1 times [2018-09-20 15:06:14,443 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:14,443 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-20 15:06:14,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:14,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:14,651 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 14 treesize of output 11 [2018-09-20 15:06:14,658 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 11 treesize of output 10 [2018-09-20 15:06:14,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:14,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:14,718 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 20 treesize of output 16 [2018-09-20 15:06:14,730 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 16 treesize of output 4 [2018-09-20 15:06:14,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:14,750 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-20 15:06:14,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:15,062 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-20 15:06:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:15,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:15,931 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:16,827 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-20 15:06:17,188 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-20 15:06:17,188 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-20 15:06:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:17,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-20 15:06:17,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-20 15:06:18,336 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-20 15:06:18,478 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-09-20 15:06:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-20 15:06:19,719 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-20 15:06:19,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 10] total 24 [2018-09-20 15:06:19,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-20 15:06:19,720 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-20 15:06:19,721 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2018-09-20 15:06:19,721 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 24 states. [2018-09-20 15:06:24,939 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-09-20 15:06:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:25,269 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2018-09-20 15:06:25,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-20 15:06:25,272 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-09-20 15:06:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:25,273 INFO L225 Difference]: With dead ends: 71 [2018-09-20 15:06:25,273 INFO L226 Difference]: Without dead ends: 61 [2018-09-20 15:06:25,274 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2018-09-20 15:06:25,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-20 15:06:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 50. [2018-09-20 15:06:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-20 15:06:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-09-20 15:06:25,281 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 61 [2018-09-20 15:06:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:25,283 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-09-20 15:06:25,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-20 15:06:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-09-20 15:06:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-20 15:06:25,284 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:25,284 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-20 15:06:25,284 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:25,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1600601359, now seen corresponding path program 1 times [2018-09-20 15:06:25,287 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:25,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:25,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:25,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:25,455 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 14 treesize of output 11 [2018-09-20 15:06:25,462 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 11 treesize of output 10 [2018-09-20 15:06:25,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:25,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:25,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:25,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-20 15:06:25,558 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 20 treesize of output 16 [2018-09-20 15:06:25,577 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 16 treesize of output 4 [2018-09-20 15:06:25,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:25,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:25,613 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-20 15:06:25,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-20 15:06:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:25,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:25,943 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:25,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-20 15:06:25,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-20 15:06:25,944 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-20 15:06:25,944 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-20 15:06:25,944 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 10 states. [2018-09-20 15:06:27,241 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-20 15:06:27,498 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:06:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:28,190 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-09-20 15:06:28,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-20 15:06:28,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-09-20 15:06:28,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:28,192 INFO L225 Difference]: With dead ends: 63 [2018-09-20 15:06:28,193 INFO L226 Difference]: Without dead ends: 54 [2018-09-20 15:06:28,193 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-20 15:06:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-20 15:06:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-09-20 15:06:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-20 15:06:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-09-20 15:06:28,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 62 [2018-09-20 15:06:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:28,200 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-09-20 15:06:28,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-20 15:06:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-09-20 15:06:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:06:28,201 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:28,201 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-20 15:06:28,202 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash 863180286, now seen corresponding path program 1 times [2018-09-20 15:06:28,202 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:28,202 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:28,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:28,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:28,375 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:28,376 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:28,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-20 15:06:28,384 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:28,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-20 15:06:28,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:28,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:28,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:28,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-20 15:06:28,707 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:28,707 INFO L682 Elim1Store]: detected equality via solver [2018-09-20 15:06:28,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-20 15:06:28,725 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:28,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-20 15:06:28,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:28,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:28,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-20 15:06:28,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-20 15:06:28,908 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 35 treesize of output 27 [2018-09-20 15:06:28,916 INFO L700 Elim1Store]: detected not equals via solver [2018-09-20 15:06:28,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-20 15:06:28,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-20 15:06:28,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-20 15:06:28,948 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-20 15:06:28,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-20 15:06:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-20 15:06:29,456 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:29,468 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:29,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-09-20 15:06:29,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-20 15:06:29,469 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-20 15:06:29,469 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-09-20 15:06:29,469 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-09-20 15:06:30,568 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-20 15:06:31,040 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-09-20 15:06:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:31,950 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-09-20 15:06:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-20 15:06:31,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2018-09-20 15:06:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:31,954 INFO L225 Difference]: With dead ends: 59 [2018-09-20 15:06:31,954 INFO L226 Difference]: Without dead ends: 50 [2018-09-20 15:06:31,955 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2018-09-20 15:06:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-20 15:06:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-09-20 15:06:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-20 15:06:31,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-09-20 15:06:31,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 63 [2018-09-20 15:06:31,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:31,963 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-09-20 15:06:31,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-20 15:06:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-09-20 15:06:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-20 15:06:31,965 INFO L368 BasicCegarLoop]: Found error trace [2018-09-20 15:06:31,965 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-20 15:06:31,965 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-20 15:06:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -933771073, now seen corresponding path program 1 times [2018-09-20 15:06:31,967 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-20 15:06:31,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-20 15:06:31,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-20 15:06:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-20 15:06:32,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-20 15:06:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-20 15:06:32,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-20 15:06:32,118 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-20 15:06:32,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-20 15:06:32,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-20 15:06:32,119 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-20 15:06:32,119 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,119 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2018-09-20 15:06:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-20 15:06:32,138 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-09-20 15:06:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-20 15:06:32,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-09-20 15:06:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-20 15:06:32,139 INFO L225 Difference]: With dead ends: 48 [2018-09-20 15:06:32,139 INFO L226 Difference]: Without dead ends: 0 [2018-09-20 15:06:32,140 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-20 15:06:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-20 15:06:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-20 15:06:32,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-20 15:06:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-20 15:06:32,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2018-09-20 15:06:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-20 15:06:32,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-20 15:06:32,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-20 15:06:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-20 15:06:32,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-20 15:06:32,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-20 15:06:32,432 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-09-20 15:06:32,520 INFO L429 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 16) the Hoare annotation is: true [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 16) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 16) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleFINAL(lines 17 42) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L23-2(line 23) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. [2018-09-20 15:06:32,521 INFO L426 ceAbstractionStarter]: For program point L21-2(line 21) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L21-3(line 21) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L429 ceAbstractionStarter]: At program point __fpclassify_doubleENTRY(lines 17 42) the Hoare annotation is: true [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point __fpclassify_doubleEXIT(lines 17 42) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L24-2(line 24) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L24-3(line 24) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-09-20 15:06:32,522 INFO L422 ceAbstractionStarter]: At program point L20-3(lines 20 25) the Hoare annotation is: (= |__fpclassify_double_#in~x| __fpclassify_double_~x) [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point L20-4(lines 17 42) no Hoare annotation was computed. [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:06:32,523 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-20 15:06:32,523 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-20 15:06:32,523 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-20 15:06:32,523 INFO L422 ceAbstractionStarter]: At program point L64(line 64) the Hoare annotation is: (and (= (fp.div RNE (_ +zero 11 53) (_ +zero 11 53)) main_~y~0) (fp.eq main_~x~0 main_~x~0)) [2018-09-20 15:06:32,523 INFO L426 ceAbstractionStarter]: For program point L64-1(line 64) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L422 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (= (fp.div RNE (_ +zero 11 53) (_ +zero 11 53)) main_~y~0) [2018-09-20 15:06:32,524 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 53 74) the Hoare annotation is: true [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point L62-1(lines 62 71) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point L62-3(lines 62 71) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 53 74) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 53 74) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point L67(lines 67 70) no Hoare annotation was computed. [2018-09-20 15:06:32,524 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-09-20 15:06:32,525 INFO L426 ceAbstractionStarter]: For program point fmin_doubleFINAL(lines 44 51) no Hoare annotation was computed. [2018-09-20 15:06:32,525 INFO L429 ceAbstractionStarter]: At program point fmin_doubleENTRY(lines 44 51) the Hoare annotation is: true [2018-09-20 15:06:32,525 INFO L426 ceAbstractionStarter]: For program point fmin_doubleEXIT(lines 44 51) no Hoare annotation was computed. [2018-09-20 15:06:32,525 INFO L426 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-09-20 15:06:32,525 INFO L426 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-09-20 15:06:32,525 INFO L422 ceAbstractionStarter]: At program point L47(line 47) the Hoare annotation is: (or (exists ((v_prenex_12 (_ BitVec 64))) (and (not (bvule ((_ extract 63 32) v_prenex_12) (_ bv4293918719 32))) (not (= (_ bv0 32) ((_ extract 31 0) v_prenex_12))) (= (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12)) |fmin_double_#in~x|))) (and (= fmin_double_~y |fmin_double_#in~y|) (= fmin_double_~x |fmin_double_#in~x|))) [2018-09-20 15:06:32,525 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 47 48) no Hoare annotation was computed. [2018-09-20 15:06:32,525 INFO L422 ceAbstractionStarter]: At program point L45(line 45) the Hoare annotation is: (and (= fmin_double_~y |fmin_double_#in~y|) (= fmin_double_~x |fmin_double_#in~x|)) [2018-09-20 15:06:32,525 INFO L426 ceAbstractionStarter]: For program point L45-1(lines 45 46) no Hoare annotation was computed. [2018-09-20 15:06:32,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 03:06:32 BoogieIcfgContainer [2018-09-20 15:06:32,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-20 15:06:32,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-09-20 15:06:32,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-09-20 15:06:32,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-09-20 15:06:32,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 03:05:54" (3/4) ... [2018-09-20 15:06:32,547 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-09-20 15:06:32,553 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-09-20 15:06:32,553 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-09-20 15:06:32,553 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2018-09-20 15:06:32,554 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_double [2018-09-20 15:06:32,554 INFO L316 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-09-20 15:06:32,559 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-09-20 15:06:32,560 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-09-20 15:06:32,560 INFO L850 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-09-20 15:06:32,590 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-09-20 15:06:32,615 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-09-20 15:06:32,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-09-20 15:06:32,617 INFO L168 Benchmark]: Toolchain (without parser) took 39676.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 307.2 MB). Free memory was 953.2 MB in the beginning and 906.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 353.9 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,618 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-20 15:06:32,618 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.32 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,618 INFO L168 Benchmark]: Boogie Preprocessor took 70.23 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,619 INFO L168 Benchmark]: RCFGBuilder took 820.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,619 INFO L168 Benchmark]: TraceAbstraction took 38358.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 211.5 MB). Peak memory consumption was 353.6 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,620 INFO L168 Benchmark]: Witness Printer took 74.50 ms. Allocated memory is still 1.3 GB. Free memory was 915.2 MB in the beginning and 906.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-09-20 15:06:32,626 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.26 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 343.32 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 942.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.23 ms. Allocated memory is still 1.0 GB. Free memory was 942.4 MB in the beginning and 937.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 820.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -189.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38358.78 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 142.1 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 211.5 MB). Peak memory consumption was 353.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.50 ms. Allocated memory is still 1.3 GB. Free memory was 915.2 MB in the beginning and 906.5 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 51 locations, 1 error locations. SAFE Result, 38.2s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 781 SDtfs, 307 SDslu, 2573 SDs, 0 SdLazy, 1473 SolverSat, 37 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1086 GetRequests, 936 SyntacticMatches, 5 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=10, 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, 17 MinimizatonAttempts, 41 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 18 PreInvPairs, 23 NumberOfFragments, 62 HoareAnnotationTreeSize, 18 FomulaSimplifications, 50 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 995 ConstructedInterpolants, 126 QuantifiedInterpolants, 250649 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2009 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 214/234 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...