./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label44_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label44_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 1bebc36463b2e0e304b25e3a315802f5e039b1f9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:32:27,344 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:32:27,346 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:32:27,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:32:27,361 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:32:27,362 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:32:27,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:32:27,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:32:27,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:32:27,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:32:27,373 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:32:27,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:32:27,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:32:27,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:32:27,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:32:27,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:32:27,378 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:32:27,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:32:27,382 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:32:27,383 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:32:27,385 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:32:27,386 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:32:27,389 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:32:27,389 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:32:27,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:32:27,390 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:32:27,391 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:32:27,392 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:32:27,393 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:32:27,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:32:27,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:32:27,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:32:27,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:32:27,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:32:27,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:32:27,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:32:27,398 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:32:27,414 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:32:27,415 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:32:27,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:32:27,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:32:27,416 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:32:27,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:32:27,417 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:32:27,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:32:27,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:32:27,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:32:27,418 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:32:27,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:32:27,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:32:27,419 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:32:27,419 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:32:27,420 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:32:27,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:32:27,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:32:27,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:32:27,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:32:27,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:32:27,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:32:27,422 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:32:27,422 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:32:27,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:32:27,422 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:32:27,423 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:32:27,423 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:32:27,423 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 -> 1bebc36463b2e0e304b25e3a315802f5e039b1f9 [2019-01-12 03:32:27,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:32:27,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:32:27,478 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:32:27,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:32:27,480 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:32:27,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label44_true-unreach-call.c [2019-01-12 03:32:27,532 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c628fa87/dbc28c562e8648b99653152f2a7abf6f/FLAG663d63e91 [2019-01-12 03:32:28,103 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:32:28,104 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label44_true-unreach-call.c [2019-01-12 03:32:28,121 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c628fa87/dbc28c562e8648b99653152f2a7abf6f/FLAG663d63e91 [2019-01-12 03:32:28,295 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c628fa87/dbc28c562e8648b99653152f2a7abf6f [2019-01-12 03:32:28,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:32:28,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:32:28,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:32:28,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:32:28,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:32:28,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:32:28" (1/1) ... [2019-01-12 03:32:28,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99ee0d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:28, skipping insertion in model container [2019-01-12 03:32:28,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:32:28" (1/1) ... [2019-01-12 03:32:28,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:32:28,385 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:32:28,841 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:32:28,847 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:32:28,984 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:32:29,002 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:32:29,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29 WrapperNode [2019-01-12 03:32:29,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:32:29,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:32:29,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:32:29,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:32:29,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:32:29,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:32:29,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:32:29,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:32:29,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... [2019-01-12 03:32:29,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:32:29,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:32:29,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:32:29,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:32:29,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:32:29,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:32:29,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:32:32,587 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:32:32,587 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:32:32,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:32 BoogieIcfgContainer [2019-01-12 03:32:32,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:32:32,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:32:32,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:32:32,593 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:32:32,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:32:28" (1/3) ... [2019-01-12 03:32:32,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143addc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:32:32, skipping insertion in model container [2019-01-12 03:32:32,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:32:29" (2/3) ... [2019-01-12 03:32:32,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143addc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:32:32, skipping insertion in model container [2019-01-12 03:32:32,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:32" (3/3) ... [2019-01-12 03:32:32,597 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label44_true-unreach-call.c [2019-01-12 03:32:32,607 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:32:32,615 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:32:32,629 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:32:32,661 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:32:32,662 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:32:32,662 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:32:32,662 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:32:32,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:32:32,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:32:32,664 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:32:32,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:32:32,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:32:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:32:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 03:32:32,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:32,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:32,704 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:32,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -66916295, now seen corresponding path program 1 times [2019-01-12 03:32:32,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:32,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:32,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:33,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:33,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:33,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:33,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:33,254 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:32:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:36,339 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:32:36,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:36,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-01-12 03:32:36,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:36,361 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:32:36,362 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:32:36,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:32:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:32:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:32:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:32:36,427 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 57 [2019-01-12 03:32:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:36,428 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:32:36,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:36,428 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:32:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-12 03:32:36,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:36,434 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:32:36,434 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1137249233, now seen corresponding path program 1 times [2019-01-12 03:32:36,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:36,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:36,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:36,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:36,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:36,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:36,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:36,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:36,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:36,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:36,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:36,692 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-01-12 03:32:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:38,017 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-01-12 03:32:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:38,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-01-12 03:32:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:38,024 INFO L225 Difference]: With dead ends: 840 [2019-01-12 03:32:38,024 INFO L226 Difference]: Without dead ends: 560 [2019-01-12 03:32:38,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-01-12 03:32:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-01-12 03:32:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:32:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-01-12 03:32:38,052 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 126 [2019-01-12 03:32:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:38,053 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-01-12 03:32:38,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-01-12 03:32:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-12 03:32:38,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:38,057 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:32:38,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:38,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:38,058 INFO L82 PathProgramCache]: Analyzing trace with hash 920423616, now seen corresponding path program 1 times [2019-01-12 03:32:38,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:38,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:38,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:38,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:38,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:38,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:38,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:32:38,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 03:32:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 03:32:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:32:38,407 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 6 states. [2019-01-12 03:32:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:40,319 INFO L93 Difference]: Finished difference Result 1314 states and 1839 transitions. [2019-01-12 03:32:40,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:32:40,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-01-12 03:32:40,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:40,326 INFO L225 Difference]: With dead ends: 1314 [2019-01-12 03:32:40,327 INFO L226 Difference]: Without dead ends: 840 [2019-01-12 03:32:40,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:32:40,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2019-01-12 03:32:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 421. [2019-01-12 03:32:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:32:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 593 transitions. [2019-01-12 03:32:40,352 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 593 transitions. Word has length 132 [2019-01-12 03:32:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:40,352 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 593 transitions. [2019-01-12 03:32:40,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 03:32:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 593 transitions. [2019-01-12 03:32:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-12 03:32:40,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:40,356 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:40,357 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:40,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:40,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1144312354, now seen corresponding path program 1 times [2019-01-12 03:32:40,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:40,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:40,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:40,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:40,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:40,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:40,692 INFO L87 Difference]: Start difference. First operand 421 states and 593 transitions. Second operand 4 states. [2019-01-12 03:32:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:43,355 INFO L93 Difference]: Finished difference Result 1676 states and 2365 transitions. [2019-01-12 03:32:43,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:43,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-01-12 03:32:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:43,364 INFO L225 Difference]: With dead ends: 1676 [2019-01-12 03:32:43,364 INFO L226 Difference]: Without dead ends: 1257 [2019-01-12 03:32:43,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:43,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-01-12 03:32:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 977. [2019-01-12 03:32:43,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:32:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1341 transitions. [2019-01-12 03:32:43,394 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1341 transitions. Word has length 143 [2019-01-12 03:32:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:43,394 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1341 transitions. [2019-01-12 03:32:43,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1341 transitions. [2019-01-12 03:32:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 03:32:43,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:43,406 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:43,406 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:43,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1862594837, now seen corresponding path program 1 times [2019-01-12 03:32:43,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:43,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:43,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:43,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:43,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:43,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:32:43,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:43,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:43,598 INFO L87 Difference]: Start difference. First operand 977 states and 1341 transitions. Second operand 4 states. [2019-01-12 03:32:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:44,856 INFO L93 Difference]: Finished difference Result 3342 states and 4539 transitions. [2019-01-12 03:32:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:44,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-01-12 03:32:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:44,873 INFO L225 Difference]: With dead ends: 3342 [2019-01-12 03:32:44,873 INFO L226 Difference]: Without dead ends: 2367 [2019-01-12 03:32:44,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-01-12 03:32:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1811. [2019-01-12 03:32:44,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-01-12 03:32:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2346 transitions. [2019-01-12 03:32:44,925 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2346 transitions. Word has length 165 [2019-01-12 03:32:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:44,925 INFO L480 AbstractCegarLoop]: Abstraction has 1811 states and 2346 transitions. [2019-01-12 03:32:44,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2346 transitions. [2019-01-12 03:32:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-12 03:32:44,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:44,934 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-01-12 03:32:44,935 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1827292479, now seen corresponding path program 1 times [2019-01-12 03:32:44,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:45,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:45,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:32:45,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:45,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:45,293 INFO L87 Difference]: Start difference. First operand 1811 states and 2346 transitions. Second operand 4 states. [2019-01-12 03:32:46,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:46,250 INFO L93 Difference]: Finished difference Result 4176 states and 5402 transitions. [2019-01-12 03:32:46,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:46,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-01-12 03:32:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:46,262 INFO L225 Difference]: With dead ends: 4176 [2019-01-12 03:32:46,263 INFO L226 Difference]: Without dead ends: 2367 [2019-01-12 03:32:46,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-01-12 03:32:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2019-01-12 03:32:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-01-12 03:32:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2868 transitions. [2019-01-12 03:32:46,320 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2868 transitions. Word has length 254 [2019-01-12 03:32:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:46,320 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 2868 transitions. [2019-01-12 03:32:46,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2868 transitions. [2019-01-12 03:32:46,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-12 03:32:46,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:32:46,327 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:32:46,328 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:32:46,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:32:46,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1772266684, now seen corresponding path program 1 times [2019-01-12 03:32:46,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:32:46,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:32:46,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:46,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:32:46,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:32:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:32:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:32:46,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:32:46,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:32:46,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:32:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:32:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:46,619 INFO L87 Difference]: Start difference. First operand 2367 states and 2868 transitions. Second operand 4 states. [2019-01-12 03:32:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:32:48,782 INFO L93 Difference]: Finished difference Result 4730 states and 5733 transitions. [2019-01-12 03:32:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:32:48,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 255 [2019-01-12 03:32:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:32:48,784 INFO L225 Difference]: With dead ends: 4730 [2019-01-12 03:32:48,784 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:32:48,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:32:48,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:32:48,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:32:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:32:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:32:48,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-01-12 03:32:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:32:48,791 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:32:48,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:32:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:32:48,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:32:48,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:32:49,138 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2019-01-12 03:32:49,409 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 29 [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,413 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:32:49,414 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:32:49,415 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:32:49,417 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:32:49,418 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:32:49,419 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:32:49,420 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:32:49,420 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse0 (= ~a19~0 8))) (or (and (<= ~a1~0 218) (= ~a10~0 0)) (and (< 38 ~a1~0) (= ~a12~0 0) .cse0 (= ~a4~0 14)) (and (= ~a10~0 1) (not .cse0)) (and (not (= ~a19~0 10)) (not (= 1 ~a10~0))))) [2019-01-12 03:32:49,420 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:32:49,420 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:32:49,420 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:32:49,421 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:32:49,422 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,427 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,428 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,429 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-01-12 03:32:49,429 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:32:49,429 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:32:49,429 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,430 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:32:49,431 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (= ~a19~0 8))) (or (and (<= ~a1~0 218) (= ~a10~0 0)) (and (< 38 ~a1~0) (= ~a12~0 0) .cse0 (= ~a4~0 14)) (and (= ~a10~0 1) (not .cse0)) (and (not (= ~a19~0 10)) (not (= 1 ~a10~0))))) [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,432 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:32:49,433 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,434 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:32:49,435 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:32:49,436 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:32:49,437 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:32:49,438 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:32:49,439 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,440 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:32:49,441 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:32:49,442 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:32:49,442 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:32:49,442 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:32:49,442 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:32:49,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:32:49 BoogieIcfgContainer [2019-01-12 03:32:49,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:32:49,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:32:49,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:32:49,461 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:32:49,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:32:32" (3/4) ... [2019-01-12 03:32:49,465 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:32:49,503 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:32:49,506 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:32:49,747 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:32:49,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:32:49,748 INFO L168 Benchmark]: Toolchain (without parser) took 21449.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 363.3 MB). Free memory was 936.6 MB in the beginning and 1.3 GB in the end (delta: -411.9 MB). Peak memory consumption was 434.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:49,753 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:32:49,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.95 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 908.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:49,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 908.4 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:49,755 INFO L168 Benchmark]: Boogie Preprocessor took 99.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:32:49,755 INFO L168 Benchmark]: RCFGBuilder took 3286.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 113.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:49,755 INFO L168 Benchmark]: TraceAbstraction took 16870.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 993.2 MB in the beginning and 819.6 MB in the end (delta: 173.5 MB). Peak memory consumption was 358.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:49,756 INFO L168 Benchmark]: Witness Printer took 286.47 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 52.4 MB). Free memory was 819.6 MB in the beginning and 1.3 GB in the end (delta: -528.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:32:49,760 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 702.95 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 908.4 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 197.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 908.4 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.95 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. * RCFGBuilder took 3286.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 113.1 MB). Peak memory consumption was 113.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16870.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 993.2 MB in the beginning and 819.6 MB in the end (delta: 173.5 MB). Peak memory consumption was 358.1 MB. Max. memory is 11.5 GB. * Witness Printer took 286.47 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 52.4 MB). Free memory was 819.6 MB in the beginning and 1.3 GB in the end (delta: -528.9 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 582]: Loop Invariant Derived loop invariant: (((a1 <= 218 && a10 == 0) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || (a10 == 1 && !(a19 == 8))) || (!(a19 == 10) && !(1 == a10)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((a1 <= 218 && a10 == 0) || (((38 < a1 && a12 == 0) && a19 == 8) && a4 == 14)) || (a10 == 1 && !(a19 == 8))) || (!(a19 == 10) && !(1 == a10)) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 16.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 SDtfs, 1585 SDslu, 84 SDs, 0 SdLazy, 5050 SolverSat, 840 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=6, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1533 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 77 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2042 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 950 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1132 NumberOfCodeBlocks, 1132 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1125 ConstructedInterpolants, 0 QuantifiedInterpolants, 596289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 584/584 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...