./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label26_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/Problem11_label26_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 848d030cccdff5a4ae4d83a1350fa05a55064ab8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:39:25,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:39:25,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:39:25,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:39:25,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:39:25,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:39:25,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:39:25,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:39:25,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:39:25,328 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:39:25,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:39:25,329 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:39:25,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:39:25,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:39:25,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:39:25,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:39:25,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:39:25,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:39:25,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:39:25,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:39:25,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:39:25,353 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:39:25,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:39:25,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:39:25,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:39:25,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:39:25,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:39:25,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:39:25,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:39:25,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:39:25,372 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:39:25,373 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:39:25,373 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:39:25,373 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:39:25,374 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:39:25,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:39:25,378 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:39:25,402 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:39:25,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:39:25,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:39:25,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:39:25,403 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:39:25,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:39:25,405 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:39:25,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:39:25,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:39:25,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:39:25,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:39:25,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:39:25,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:39:25,406 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:39:25,407 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:39:25,407 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:39:25,407 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:39:25,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:39:25,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:39:25,408 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:39:25,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:39:25,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:39:25,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:39:25,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:39:25,409 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:39:25,410 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:39:25,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:39:25,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:39:25,410 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 -> 848d030cccdff5a4ae4d83a1350fa05a55064ab8 [2019-01-12 03:39:25,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:39:25,484 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:39:25,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:39:25,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:39:25,493 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:39:25,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label26_true-unreach-call.c [2019-01-12 03:39:25,552 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320c29bba/5c7c0713b03844bd98671e84ba7f622f/FLAGb635a1fcb [2019-01-12 03:39:26,130 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:39:26,131 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label26_true-unreach-call.c [2019-01-12 03:39:26,152 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320c29bba/5c7c0713b03844bd98671e84ba7f622f/FLAGb635a1fcb [2019-01-12 03:39:26,325 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320c29bba/5c7c0713b03844bd98671e84ba7f622f [2019-01-12 03:39:26,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:39:26,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:39:26,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:39:26,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:39:26,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:39:26,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:39:26" (1/1) ... [2019-01-12 03:39:26,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2359d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:26, skipping insertion in model container [2019-01-12 03:39:26,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:39:26" (1/1) ... [2019-01-12 03:39:26,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:39:26,432 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:39:27,047 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:39:27,059 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:39:27,360 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:39:27,389 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:39:27,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27 WrapperNode [2019-01-12 03:39:27,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:39:27,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:39:27,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:39:27,392 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:39:27,511 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:39:27" (1/1) ... [2019-01-12 03:39:27,562 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:39:27" (1/1) ... [2019-01-12 03:39:27,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:39:27,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:39:27,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:39:27,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:39:27,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (1/1) ... [2019-01-12 03:39:27,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:39:27,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:39:27,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:39:27,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:39:27,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (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:39:27,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:39:27,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:39:31,994 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:39:31,994 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:39:31,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:39:31 BoogieIcfgContainer [2019-01-12 03:39:31,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:39:31,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:39:31,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:39:32,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:39:32,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:39:26" (1/3) ... [2019-01-12 03:39:32,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1085f12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:39:32, skipping insertion in model container [2019-01-12 03:39:32,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:39:27" (2/3) ... [2019-01-12 03:39:32,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1085f12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:39:32, skipping insertion in model container [2019-01-12 03:39:32,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:39:31" (3/3) ... [2019-01-12 03:39:32,007 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label26_true-unreach-call.c [2019-01-12 03:39:32,017 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:39:32,026 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:39:32,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:39:32,080 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:39:32,081 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:39:32,081 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:39:32,081 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:39:32,082 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:39:32,082 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:39:32,082 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:39:32,082 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:39:32,082 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:39:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:39:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 03:39:32,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:39:32,133 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] [2019-01-12 03:39:32,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:39:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:39:32,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1453294289, now seen corresponding path program 1 times [2019-01-12 03:39:32,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:39:32,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:39:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:39:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:39:32,663 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:39:32,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:39:32,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:39:32,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:39:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:39:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:39:32,692 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:39:36,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:39:36,078 INFO L93 Difference]: Finished difference Result 959 states and 1737 transitions. [2019-01-12 03:39:36,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:39:36,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-12 03:39:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:39:36,103 INFO L225 Difference]: With dead ends: 959 [2019-01-12 03:39:36,103 INFO L226 Difference]: Without dead ends: 609 [2019-01-12 03:39:36,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:39:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-01-12 03:39:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 595. [2019-01-12 03:39:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-01-12 03:39:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 905 transitions. [2019-01-12 03:39:36,194 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 905 transitions. Word has length 39 [2019-01-12 03:39:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:39:36,195 INFO L480 AbstractCegarLoop]: Abstraction has 595 states and 905 transitions. [2019-01-12 03:39:36,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:39:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 905 transitions. [2019-01-12 03:39:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-12 03:39:36,201 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:39:36,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:36,202 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:39:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:39:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1202089462, now seen corresponding path program 1 times [2019-01-12 03:39:36,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:39:36,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:39:36,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:36,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:39:36,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:39:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:39:36,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:39:36,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:39:36,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:39:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:39:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:39:36,525 INFO L87 Difference]: Start difference. First operand 595 states and 905 transitions. Second operand 4 states. [2019-01-12 03:39:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:39:39,286 INFO L93 Difference]: Finished difference Result 2305 states and 3518 transitions. [2019-01-12 03:39:39,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:39:39,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-01-12 03:39:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:39:39,300 INFO L225 Difference]: With dead ends: 2305 [2019-01-12 03:39:39,300 INFO L226 Difference]: Without dead ends: 1712 [2019-01-12 03:39:39,308 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:39:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-01-12 03:39:39,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1528. [2019-01-12 03:39:39,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-12 03:39:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2081 transitions. [2019-01-12 03:39:39,460 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2081 transitions. Word has length 120 [2019-01-12 03:39:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:39:39,461 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 2081 transitions. [2019-01-12 03:39:39,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:39:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2081 transitions. [2019-01-12 03:39:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-12 03:39:39,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:39:39,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,470 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:39:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:39:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -64384758, now seen corresponding path program 1 times [2019-01-12 03:39:39,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:39:39,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:39:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:39:39,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:39:39,985 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 03:39:40,491 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2019-01-12 03:39:40,667 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-01-12 03:39:41,229 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-01-12 03:39:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:39:41,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:39:41,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 03:39:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:39:41,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:39:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:39:41,354 INFO L87 Difference]: Start difference. First operand 1528 states and 2081 transitions. Second operand 8 states. [2019-01-12 03:39:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:39:43,435 INFO L93 Difference]: Finished difference Result 3265 states and 4396 transitions. [2019-01-12 03:39:43,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:39:43,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-01-12 03:39:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:39:43,447 INFO L225 Difference]: With dead ends: 3265 [2019-01-12 03:39:43,447 INFO L226 Difference]: Without dead ends: 1739 [2019-01-12 03:39:43,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:39:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2019-01-12 03:39:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1713. [2019-01-12 03:39:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-01-12 03:39:43,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2272 transitions. [2019-01-12 03:39:43,494 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2272 transitions. Word has length 178 [2019-01-12 03:39:43,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:39:43,495 INFO L480 AbstractCegarLoop]: Abstraction has 1713 states and 2272 transitions. [2019-01-12 03:39:43,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:39:43,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2272 transitions. [2019-01-12 03:39:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-12 03:39:43,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:39:43,499 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, 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] [2019-01-12 03:39:43,499 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:39:43,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:39:43,500 INFO L82 PathProgramCache]: Analyzing trace with hash -890036000, now seen corresponding path program 1 times [2019-01-12 03:39:43,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:39:43,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:39:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:43,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:39:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:39:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:39:44,033 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-12 03:39:44,333 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 03:39:44,531 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-01-12 03:39:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:39:44,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:39:44,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:39:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:39:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:39:44,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:39:45,662 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 19 [2019-01-12 03:39:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 69 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:39:45,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:39:45,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2019-01-12 03:39:45,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:39:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:39:45,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:39:45,884 INFO L87 Difference]: Start difference. First operand 1713 states and 2272 transitions. Second operand 10 states. [2019-01-12 03:39:46,252 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-12 03:39:50,284 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-01-12 03:39:50,866 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-01-12 03:39:51,390 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 03:39:53,141 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-12 03:40:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:06,485 INFO L93 Difference]: Finished difference Result 15963 states and 21250 transitions. [2019-01-12 03:40:06,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 03:40:06,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2019-01-12 03:40:06,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:06,548 INFO L225 Difference]: With dead ends: 15963 [2019-01-12 03:40:06,548 INFO L226 Difference]: Without dead ends: 14437 [2019-01-12 03:40:06,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2019-01-12 03:40:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14437 states. [2019-01-12 03:40:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14437 to 7604. [2019-01-12 03:40:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7604 states. [2019-01-12 03:40:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7604 states to 7604 states and 8890 transitions. [2019-01-12 03:40:06,763 INFO L78 Accepts]: Start accepts. Automaton has 7604 states and 8890 transitions. Word has length 221 [2019-01-12 03:40:06,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:06,764 INFO L480 AbstractCegarLoop]: Abstraction has 7604 states and 8890 transitions. [2019-01-12 03:40:06,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:40:06,764 INFO L276 IsEmpty]: Start isEmpty. Operand 7604 states and 8890 transitions. [2019-01-12 03:40:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-12 03:40:06,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:06,774 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, 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, 1, 1, 1, 1] [2019-01-12 03:40:06,774 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1738142985, now seen corresponding path program 1 times [2019-01-12 03:40:06,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:06,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:06,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:06,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:07,263 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 03:40:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:07,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:07,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:07,307 INFO L87 Difference]: Start difference. First operand 7604 states and 8890 transitions. Second operand 4 states. [2019-01-12 03:40:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:09,286 INFO L93 Difference]: Finished difference Result 15959 states and 18945 transitions. [2019-01-12 03:40:09,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:09,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-01-12 03:40:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:09,313 INFO L225 Difference]: With dead ends: 15959 [2019-01-12 03:40:09,313 INFO L226 Difference]: Without dead ends: 8541 [2019-01-12 03:40:09,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8541 states. [2019-01-12 03:40:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8541 to 8160. [2019-01-12 03:40:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8160 states. [2019-01-12 03:40:09,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 9495 transitions. [2019-01-12 03:40:09,475 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 9495 transitions. Word has length 236 [2019-01-12 03:40:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:09,476 INFO L480 AbstractCegarLoop]: Abstraction has 8160 states and 9495 transitions. [2019-01-12 03:40:09,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 9495 transitions. [2019-01-12 03:40:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-01-12 03:40:09,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:09,485 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, 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, 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] [2019-01-12 03:40:09,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1156575387, now seen corresponding path program 1 times [2019-01-12 03:40:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:09,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:09,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:10,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:10,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:10,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:40:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:40:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:40:10,287 INFO L87 Difference]: Start difference. First operand 8160 states and 9495 transitions. Second operand 5 states. [2019-01-12 03:40:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:13,524 INFO L93 Difference]: Finished difference Result 24075 states and 28105 transitions. [2019-01-12 03:40:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:40:13,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 299 [2019-01-12 03:40:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:13,559 INFO L225 Difference]: With dead ends: 24075 [2019-01-12 03:40:13,559 INFO L226 Difference]: Without dead ends: 15549 [2019-01-12 03:40:13,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:40:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15549 states. [2019-01-12 03:40:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15549 to 13319. [2019-01-12 03:40:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13319 states. [2019-01-12 03:40:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 15058 transitions. [2019-01-12 03:40:13,775 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 15058 transitions. Word has length 299 [2019-01-12 03:40:13,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:13,776 INFO L480 AbstractCegarLoop]: Abstraction has 13319 states and 15058 transitions. [2019-01-12 03:40:13,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:40:13,776 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 15058 transitions. [2019-01-12 03:40:13,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-12 03:40:13,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:13,788 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, 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, 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] [2019-01-12 03:40:13,789 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -921215904, now seen corresponding path program 1 times [2019-01-12 03:40:13,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:13,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-01-12 03:40:14,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:40:14,311 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:40:14,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:14,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:40:15,210 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2019-01-12 03:40:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 156 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:40:15,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:40:15,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-12 03:40:15,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:40:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:40:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:40:15,982 INFO L87 Difference]: Start difference. First operand 13319 states and 15058 transitions. Second operand 8 states. [2019-01-12 03:40:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:21,865 INFO L93 Difference]: Finished difference Result 35656 states and 40444 transitions. [2019-01-12 03:40:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:40:21,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 321 [2019-01-12 03:40:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:21,921 INFO L225 Difference]: With dead ends: 35656 [2019-01-12 03:40:21,922 INFO L226 Difference]: Without dead ends: 22339 [2019-01-12 03:40:21,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 317 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:40:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22339 states. [2019-01-12 03:40:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22339 to 16256. [2019-01-12 03:40:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16256 states. [2019-01-12 03:40:22,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16256 states to 16256 states and 18401 transitions. [2019-01-12 03:40:22,235 INFO L78 Accepts]: Start accepts. Automaton has 16256 states and 18401 transitions. Word has length 321 [2019-01-12 03:40:22,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:22,237 INFO L480 AbstractCegarLoop]: Abstraction has 16256 states and 18401 transitions. [2019-01-12 03:40:22,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:40:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16256 states and 18401 transitions. [2019-01-12 03:40:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-01-12 03:40:22,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:22,252 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:22,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:22,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1089154526, now seen corresponding path program 1 times [2019-01-12 03:40:22,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:22,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:22,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:22,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-01-12 03:40:22,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:22,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:22,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:40:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:40:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:40:22,575 INFO L87 Difference]: Start difference. First operand 16256 states and 18401 transitions. Second operand 5 states. [2019-01-12 03:40:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:25,174 INFO L93 Difference]: Finished difference Result 43016 states and 48827 transitions. [2019-01-12 03:40:25,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:40:25,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 334 [2019-01-12 03:40:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:25,208 INFO L225 Difference]: With dead ends: 43016 [2019-01-12 03:40:25,208 INFO L226 Difference]: Without dead ends: 26946 [2019-01-12 03:40:25,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:40:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26946 states. [2019-01-12 03:40:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26946 to 16443. [2019-01-12 03:40:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16443 states. [2019-01-12 03:40:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16443 states to 16443 states and 18688 transitions. [2019-01-12 03:40:25,640 INFO L78 Accepts]: Start accepts. Automaton has 16443 states and 18688 transitions. Word has length 334 [2019-01-12 03:40:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:25,641 INFO L480 AbstractCegarLoop]: Abstraction has 16443 states and 18688 transitions. [2019-01-12 03:40:25,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:40:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 16443 states and 18688 transitions. [2019-01-12 03:40:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-12 03:40:25,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:25,658 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:40:25,658 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:25,659 INFO L82 PathProgramCache]: Analyzing trace with hash -216127722, now seen corresponding path program 1 times [2019-01-12 03:40:25,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:25,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:25,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:25,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-01-12 03:40:26,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:26,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:26,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:26,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:26,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:26,158 INFO L87 Difference]: Start difference. First operand 16443 states and 18688 transitions. Second operand 4 states. [2019-01-12 03:40:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:28,231 INFO L93 Difference]: Finished difference Result 37313 states and 42810 transitions. [2019-01-12 03:40:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:28,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 364 [2019-01-12 03:40:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:28,260 INFO L225 Difference]: With dead ends: 37313 [2019-01-12 03:40:28,260 INFO L226 Difference]: Without dead ends: 21056 [2019-01-12 03:40:28,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21056 states. [2019-01-12 03:40:28,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21056 to 18282. [2019-01-12 03:40:28,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2019-01-12 03:40:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 20411 transitions. [2019-01-12 03:40:28,577 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 20411 transitions. Word has length 364 [2019-01-12 03:40:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:28,577 INFO L480 AbstractCegarLoop]: Abstraction has 18282 states and 20411 transitions. [2019-01-12 03:40:28,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:28,578 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 20411 transitions. [2019-01-12 03:40:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-01-12 03:40:28,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:28,592 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:40:28,592 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:28,594 INFO L82 PathProgramCache]: Analyzing trace with hash 142462327, now seen corresponding path program 1 times [2019-01-12 03:40:28,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:28,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:28,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:28,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:28,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-01-12 03:40:29,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:29,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:40:29,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:40:29,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:40:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:40:29,074 INFO L87 Difference]: Start difference. First operand 18282 states and 20411 transitions. Second operand 3 states. [2019-01-12 03:40:29,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:29,664 INFO L93 Difference]: Finished difference Result 33978 states and 37962 transitions. [2019-01-12 03:40:29,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:40:29,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 379 [2019-01-12 03:40:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:29,687 INFO L225 Difference]: With dead ends: 33978 [2019-01-12 03:40:29,687 INFO L226 Difference]: Without dead ends: 17724 [2019-01-12 03:40:29,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:40:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17724 states. [2019-01-12 03:40:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17724 to 17723. [2019-01-12 03:40:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17723 states. [2019-01-12 03:40:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17723 states to 17723 states and 19733 transitions. [2019-01-12 03:40:29,984 INFO L78 Accepts]: Start accepts. Automaton has 17723 states and 19733 transitions. Word has length 379 [2019-01-12 03:40:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:29,985 INFO L480 AbstractCegarLoop]: Abstraction has 17723 states and 19733 transitions. [2019-01-12 03:40:29,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:40:29,986 INFO L276 IsEmpty]: Start isEmpty. Operand 17723 states and 19733 transitions. [2019-01-12 03:40:30,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-01-12 03:40:30,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:40:30,015 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 03:40:30,016 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:40:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:40:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash -800907807, now seen corresponding path program 1 times [2019-01-12 03:40:30,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:40:30,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:40:30,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:30,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:40:30,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:40:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:40:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-01-12 03:40:30,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:40:30,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:40:30,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:40:30,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:40:30,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:40:30,464 INFO L87 Difference]: Start difference. First operand 17723 states and 19733 transitions. Second operand 4 states. [2019-01-12 03:40:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:40:32,125 INFO L93 Difference]: Finished difference Result 37101 states and 41124 transitions. [2019-01-12 03:40:32,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:40:32,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 460 [2019-01-12 03:40:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:40:32,126 INFO L225 Difference]: With dead ends: 37101 [2019-01-12 03:40:32,127 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:40:32,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:40:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:40:32,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:40:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:40:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:40:32,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 460 [2019-01-12 03:40:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:40:32,141 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:40:32,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:40:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:40:32,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:40:32,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:40:32,175 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:32,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,483 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 544 DAG size of output: 293 [2019-01-12 03:40:33,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:33,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:40:34,302 WARN L181 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 541 DAG size of output: 293 [2019-01-12 03:40:36,248 WARN L181 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 272 DAG size of output: 59 [2019-01-12 03:40:37,997 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 272 DAG size of output: 59 [2019-01-12 03:40:38,000 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:40:38,000 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:40:38,000 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:40:38,001 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:40:38,002 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse7 (+ ~a23~0 43))) (let ((.cse3 (= 1 ~a4~0)) (.cse0 (<= .cse7 0))) (let ((.cse5 (= ~a25~0 10)) (.cse6 (<= (+ ~a29~0 28445) 0)) (.cse4 (and .cse3 .cse0)) (.cse9 (= 1 ~a3~0)) (.cse2 (not (= ~a25~0 13))) (.cse10 (< 245 ~a29~0)) (.cse1 (= ~a8~0 15)) (.cse8 (and (= ~a25~0 12) (not (= ~a4~0 1)))) (.cse11 (<= 130 ~a29~0))) (or (and (and .cse0 (<= ~a29~0 140)) .cse1 .cse2) (and .cse1 (and .cse3 (< 138 ~a23~0))) (and .cse1 .cse2 .cse4) (and .cse5 .cse3 .cse0) (and .cse1 .cse6 .cse5) (and (<= ~a23~0 312) .cse1 (not (= ~a25~0 11)) (< 0 .cse7)) (and .cse1 .cse6 .cse8) (and .cse1 (and .cse9 .cse3 .cse10)) (and .cse4 .cse9 (= 15 ~a8~0) .cse11) (and .cse0 .cse1 .cse2 .cse10) (and .cse1 .cse8 .cse11))))) [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,003 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,004 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,005 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,005 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:40:38,011 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2019-01-12 03:40:38,012 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,013 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,013 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,017 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,018 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,019 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:40:38,020 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,021 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,022 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:40:38,023 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,024 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,025 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:40:38,026 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:40:38,027 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,028 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,029 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,030 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,031 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:40:38,032 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:40:38,033 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,034 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,035 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,035 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse7 (+ ~a23~0 43))) (let ((.cse3 (= 1 ~a4~0)) (.cse0 (<= .cse7 0))) (let ((.cse5 (= ~a25~0 10)) (.cse6 (<= (+ ~a29~0 28445) 0)) (.cse4 (and .cse3 .cse0)) (.cse9 (= 1 ~a3~0)) (.cse2 (not (= ~a25~0 13))) (.cse10 (< 245 ~a29~0)) (.cse1 (= ~a8~0 15)) (.cse8 (and (= ~a25~0 12) (not (= ~a4~0 1)))) (.cse11 (<= 130 ~a29~0))) (or (and (and .cse0 (<= ~a29~0 140)) .cse1 .cse2) (and .cse1 (and .cse3 (< 138 ~a23~0))) (and .cse1 .cse2 .cse4) (and .cse5 .cse3 .cse0) (and .cse1 .cse6 .cse5) (and (<= ~a23~0 312) .cse1 (not (= ~a25~0 11)) (< 0 .cse7)) (and .cse1 .cse6 .cse8) (and .cse1 (and .cse9 .cse3 .cse10)) (and .cse4 .cse9 (= 15 ~a8~0) .cse11) (and .cse0 .cse1 .cse2 .cse10) (and .cse1 .cse8 .cse11))))) [2019-01-12 03:40:38,035 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,035 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,036 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:40:38,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:40:38 BoogieIcfgContainer [2019-01-12 03:40:38,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:40:38,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:40:38,081 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:40:38,082 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:40:38,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:39:31" (3/4) ... [2019-01-12 03:40:38,092 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:40:38,131 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:40:38,133 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:40:38,362 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:40:38,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:40:38,363 INFO L168 Benchmark]: Toolchain (without parser) took 72033.28 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.1 GB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 924.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,364 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:40:38,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1058.10 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 891.0 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,364 INFO L168 Benchmark]: Boogie Procedure Inliner took 322.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 891.0 MB in the beginning and 1.1 GB in the end (delta: -223.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,365 INFO L168 Benchmark]: Boogie Preprocessor took 156.33 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,365 INFO L168 Benchmark]: RCFGBuilder took 4126.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 935.3 MB in the end (delta: 172.5 MB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,365 INFO L168 Benchmark]: TraceAbstraction took 66083.18 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 977.3 MB). Free memory was 935.3 MB in the beginning and 1.2 GB in the end (delta: -226.5 MB). Peak memory consumption was 944.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,366 INFO L168 Benchmark]: Witness Printer took 280.83 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:40:38,375 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1058.10 ms. Allocated memory is still 1.0 GB. Free memory was 939.3 MB in the beginning and 891.0 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 322.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 891.0 MB in the beginning and 1.1 GB in the end (delta: -223.8 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 156.33 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4126.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 935.3 MB in the end (delta: 172.5 MB). Peak memory consumption was 172.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 66083.18 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 977.3 MB). Free memory was 935.3 MB in the beginning and 1.2 GB in the end (delta: -226.5 MB). Peak memory consumption was 944.7 MB. Max. memory is 11.5 GB. * Witness Printer took 280.83 ms. Allocated memory is still 2.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 123]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((((a23 + 43 <= 0 && a29 <= 140) && a8 == 15) && !(a25 == 13)) || (a8 == 15 && 1 == a4 && 138 < a23)) || ((a8 == 15 && !(a25 == 13)) && 1 == a4 && a23 + 43 <= 0)) || ((a25 == 10 && 1 == a4) && a23 + 43 <= 0)) || ((a8 == 15 && a29 + 28445 <= 0) && a25 == 10)) || (((a23 <= 312 && a8 == 15) && !(a25 == 11)) && 0 < a23 + 43)) || ((a8 == 15 && a29 + 28445 <= 0) && a25 == 12 && !(a4 == 1))) || (a8 == 15 && (1 == a3 && 1 == a4) && 245 < a29)) || ((((1 == a4 && a23 + 43 <= 0) && 1 == a3) && 15 == a8) && 130 <= a29)) || (((a23 + 43 <= 0 && a8 == 15) && !(a25 == 13)) && 245 < a29)) || ((a8 == 15 && a25 == 12 && !(a4 == 1)) && 130 <= a29) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((a23 + 43 <= 0 && a29 <= 140) && a8 == 15) && !(a25 == 13)) || (a8 == 15 && 1 == a4 && 138 < a23)) || ((a8 == 15 && !(a25 == 13)) && 1 == a4 && a23 + 43 <= 0)) || ((a25 == 10 && 1 == a4) && a23 + 43 <= 0)) || ((a8 == 15 && a29 + 28445 <= 0) && a25 == 10)) || (((a23 <= 312 && a8 == 15) && !(a25 == 11)) && 0 < a23 + 43)) || ((a8 == 15 && a29 + 28445 <= 0) && a25 == 12 && !(a4 == 1))) || (a8 == 15 && (1 == a3 && 1 == a4) && 245 < a29)) || ((((1 == a4 && a23 + 43 <= 0) && 1 == a3) && 15 == a8) && 130 <= a29)) || (((a23 + 43 <= 0 && a8 == 15) && !(a25 == 13)) && 245 < a29)) || ((a8 == 15 && a25 == 12 && !(a4 == 1)) && 130 <= a29) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 65.9s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 47.3s AutomataDifference, 0.0s DeadEndRemovalTime, 5.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 1376 SDtfs, 9865 SDslu, 802 SDs, 0 SdLazy, 20004 SolverSat, 3453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 37.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 547 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18282occurred in iteration=9, 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: 2.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 29029 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 226 NumberOfFragments, 335 HoareAnnotationTreeSize, 3 FomulaSimplifications, 107287 FormulaSimplificationTreeSizeReduction, 2.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 28224 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3493 NumberOfCodeBlocks, 3493 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3480 ConstructedInterpolants, 176 QuantifiedInterpolants, 5450414 SizeOfPredicates, 6 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 2670/2940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...