./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_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 709affefef23ed36745d6b141c72063985c3a0fd ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 23:41:18,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 23:41:18,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 23:41:18,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 23:41:18,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 23:41:18,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 23:41:18,290 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 23:41:18,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 23:41:18,293 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 23:41:18,294 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 23:41:18,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 23:41:18,295 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 23:41:18,296 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 23:41:18,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 23:41:18,298 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 23:41:18,299 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 23:41:18,300 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 23:41:18,301 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 23:41:18,303 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 23:41:18,305 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 23:41:18,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 23:41:18,308 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 23:41:18,311 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 23:41:18,311 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 23:41:18,311 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 23:41:18,312 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 23:41:18,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 23:41:18,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 23:41:18,321 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 23:41:18,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 23:41:18,323 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 23:41:18,323 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 23:41:18,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 23:41:18,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 23:41:18,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 23:41:18,328 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 23:41:18,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 23:41:18,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 23:41:18,362 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 23:41:18,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 23:41:18,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 23:41:18,364 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 23:41:18,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 23:41:18,365 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 23:41:18,365 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 23:41:18,365 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 23:41:18,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 23:41:18,366 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 23:41:18,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 23:41:18,366 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 23:41:18,366 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 23:41:18,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 23:41:18,368 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 23:41:18,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 23:41:18,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 23:41:18,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 23:41:18,370 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 23:41:18,370 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 23:41:18,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:41:18,370 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 23:41:18,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 23:41:18,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 23:41:18,371 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 23:41:18,371 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 23:41:18,371 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 23:41:18,372 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 -> 709affefef23ed36745d6b141c72063985c3a0fd [2018-12-30 23:41:18,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 23:41:18,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 23:41:18,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 23:41:18,435 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 23:41:18,436 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 23:41:18,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_true-unreach-call.c [2018-12-30 23:41:18,502 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293ebed56/a30cb313a2a4472a802feb186b453b97/FLAG41124f721 [2018-12-30 23:41:19,212 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 23:41:19,213 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem17_label18_true-unreach-call.c [2018-12-30 23:41:19,235 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293ebed56/a30cb313a2a4472a802feb186b453b97/FLAG41124f721 [2018-12-30 23:41:19,307 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/293ebed56/a30cb313a2a4472a802feb186b453b97 [2018-12-30 23:41:19,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 23:41:19,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 23:41:19,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 23:41:19,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 23:41:19,320 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 23:41:19,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:41:19" (1/1) ... [2018-12-30 23:41:19,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a975e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:19, skipping insertion in model container [2018-12-30 23:41:19,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 11:41:19" (1/1) ... [2018-12-30 23:41:19,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 23:41:19,435 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 23:41:20,490 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:41:20,499 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 23:41:20,952 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 23:41:20,979 INFO L195 MainTranslator]: Completed translation [2018-12-30 23:41:20,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20 WrapperNode [2018-12-30 23:41:20,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 23:41:20,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 23:41:20,982 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 23:41:20,982 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 23:41:21,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 23:41:21,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 23:41:21,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 23:41:21,460 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 23:41:21,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... [2018-12-30 23:41:21,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 23:41:21,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 23:41:21,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 23:41:21,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 23:41:21,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 23:41:21,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 23:41:21,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 23:41:29,903 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 23:41:29,904 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-30 23:41:29,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:41:29 BoogieIcfgContainer [2018-12-30 23:41:29,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 23:41:29,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 23:41:29,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 23:41:29,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 23:41:29,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 11:41:19" (1/3) ... [2018-12-30 23:41:29,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490dee51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:41:29, skipping insertion in model container [2018-12-30 23:41:29,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 11:41:20" (2/3) ... [2018-12-30 23:41:29,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@490dee51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 11:41:29, skipping insertion in model container [2018-12-30 23:41:29,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:41:29" (3/3) ... [2018-12-30 23:41:29,913 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label18_true-unreach-call.c [2018-12-30 23:41:29,924 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 23:41:29,933 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 23:41:29,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 23:41:29,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 23:41:29,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 23:41:29,995 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 23:41:29,995 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 23:41:29,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 23:41:29,996 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 23:41:29,996 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 23:41:29,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 23:41:29,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 23:41:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2018-12-30 23:41:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-30 23:41:30,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:41:30,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:41:30,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:41:30,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:41:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2018-12-30 23:41:30,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:41:30,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:41:30,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:41:30,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:41:30,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:41:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:41:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:41:30,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:41:30,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:41:30,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:41:30,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:41:30,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:41:30,534 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2018-12-30 23:41:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:41:39,094 INFO L93 Difference]: Finished difference Result 2089 states and 3897 transitions. [2018-12-30 23:41:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:41:39,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-30 23:41:39,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:41:39,127 INFO L225 Difference]: With dead ends: 2089 [2018-12-30 23:41:39,128 INFO L226 Difference]: Without dead ends: 1419 [2018-12-30 23:41:39,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:41:39,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2018-12-30 23:41:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1412. [2018-12-30 23:41:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-12-30 23:41:39,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2069 transitions. [2018-12-30 23:41:39,262 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2069 transitions. Word has length 55 [2018-12-30 23:41:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:41:39,263 INFO L480 AbstractCegarLoop]: Abstraction has 1412 states and 2069 transitions. [2018-12-30 23:41:39,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:41:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2069 transitions. [2018-12-30 23:41:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-30 23:41:39,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:41:39,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:41:39,270 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:41:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:41:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1046772668, now seen corresponding path program 1 times [2018-12-30 23:41:39,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:41:39,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:41:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:41:39,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:41:39,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:41:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:41:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:41:39,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:41:39,741 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 [2018-12-30 23:41:39,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:41:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:41:39,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:41:40,598 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 26 [2018-12-30 23:41:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:41:41,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:41:41,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-30 23:41:41,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:41:41,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:41:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:41:41,083 INFO L87 Difference]: Start difference. First operand 1412 states and 2069 transitions. Second operand 8 states. [2018-12-30 23:41:41,296 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-30 23:42:03,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:03,140 INFO L93 Difference]: Finished difference Result 10106 states and 15851 transitions. [2018-12-30 23:42:03,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-30 23:42:03,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-30 23:42:03,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:03,172 INFO L225 Difference]: With dead ends: 10106 [2018-12-30 23:42:03,172 INFO L226 Difference]: Without dead ends: 5686 [2018-12-30 23:42:03,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-30 23:42:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2018-12-30 23:42:03,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 3127. [2018-12-30 23:42:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3127 states. [2018-12-30 23:42:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 4057 transitions. [2018-12-30 23:42:03,263 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 4057 transitions. Word has length 125 [2018-12-30 23:42:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:03,264 INFO L480 AbstractCegarLoop]: Abstraction has 3127 states and 4057 transitions. [2018-12-30 23:42:03,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:42:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 4057 transitions. [2018-12-30 23:42:03,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-30 23:42:03,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:03,275 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:03,276 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -983063388, now seen corresponding path program 1 times [2018-12-30 23:42:03,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:03,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:42:03,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:03,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:42:03,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:42:03,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:42:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:03,504 INFO L87 Difference]: Start difference. First operand 3127 states and 4057 transitions. Second operand 3 states. [2018-12-30 23:42:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:07,110 INFO L93 Difference]: Finished difference Result 7959 states and 10693 transitions. [2018-12-30 23:42:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:42:07,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2018-12-30 23:42:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:07,137 INFO L225 Difference]: With dead ends: 7959 [2018-12-30 23:42:07,137 INFO L226 Difference]: Without dead ends: 5259 [2018-12-30 23:42:07,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:07,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2018-12-30 23:42:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5259. [2018-12-30 23:42:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5259 states. [2018-12-30 23:42:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5259 states to 5259 states and 6628 transitions. [2018-12-30 23:42:07,251 INFO L78 Accepts]: Start accepts. Automaton has 5259 states and 6628 transitions. Word has length 203 [2018-12-30 23:42:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:07,252 INFO L480 AbstractCegarLoop]: Abstraction has 5259 states and 6628 transitions. [2018-12-30 23:42:07,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:42:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 6628 transitions. [2018-12-30 23:42:07,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-12-30 23:42:07,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:07,263 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, 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, 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] [2018-12-30 23:42:07,263 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:07,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1178526916, now seen corresponding path program 1 times [2018-12-30 23:42:07,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:07,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:07,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:07,891 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:42:08,020 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 82 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-30 23:42:08,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:42:08,020 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 [2018-12-30 23:42:08,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:08,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:42:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 285 proven. 82 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-30 23:42:08,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:42:08,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2018-12-30 23:42:08,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-30 23:42:08,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-30 23:42:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-30 23:42:08,557 INFO L87 Difference]: Start difference. First operand 5259 states and 6628 transitions. Second operand 7 states. [2018-12-30 23:42:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:18,623 INFO L93 Difference]: Finished difference Result 19909 states and 25276 transitions. [2018-12-30 23:42:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:42:18,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 369 [2018-12-30 23:42:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:18,674 INFO L225 Difference]: With dead ends: 19909 [2018-12-30 23:42:18,674 INFO L226 Difference]: Without dead ends: 14222 [2018-12-30 23:42:18,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:42:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14222 states. [2018-12-30 23:42:18,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14222 to 13781. [2018-12-30 23:42:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13781 states. [2018-12-30 23:42:18,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 16554 transitions. [2018-12-30 23:42:18,904 INFO L78 Accepts]: Start accepts. Automaton has 13781 states and 16554 transitions. Word has length 369 [2018-12-30 23:42:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:18,905 INFO L480 AbstractCegarLoop]: Abstraction has 13781 states and 16554 transitions. [2018-12-30 23:42:18,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-30 23:42:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 13781 states and 16554 transitions. [2018-12-30 23:42:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-12-30 23:42:18,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:18,913 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, 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, 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] [2018-12-30 23:42:18,913 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:18,913 INFO L82 PathProgramCache]: Analyzing trace with hash -236055178, now seen corresponding path program 1 times [2018-12-30 23:42:18,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:18,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:18,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 269 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 23:42:19,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:42:19,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:42:19,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:19,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:42:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 292 proven. 82 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-12-30 23:42:20,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:42:20,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 7 [2018-12-30 23:42:20,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:42:20,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:42:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:42:20,460 INFO L87 Difference]: Start difference. First operand 13781 states and 16554 transitions. Second operand 8 states. [2018-12-30 23:42:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:33,289 INFO L93 Difference]: Finished difference Result 45028 states and 54456 transitions. [2018-12-30 23:42:33,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:42:33,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 376 [2018-12-30 23:42:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:33,359 INFO L225 Difference]: With dead ends: 45028 [2018-12-30 23:42:33,359 INFO L226 Difference]: Without dead ends: 31248 [2018-12-30 23:42:33,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:42:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31248 states. [2018-12-30 23:42:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31248 to 24413. [2018-12-30 23:42:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24413 states. [2018-12-30 23:42:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24413 states to 24413 states and 28707 transitions. [2018-12-30 23:42:34,034 INFO L78 Accepts]: Start accepts. Automaton has 24413 states and 28707 transitions. Word has length 376 [2018-12-30 23:42:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:34,034 INFO L480 AbstractCegarLoop]: Abstraction has 24413 states and 28707 transitions. [2018-12-30 23:42:34,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:42:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 24413 states and 28707 transitions. [2018-12-30 23:42:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-12-30 23:42:34,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:34,053 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:34,053 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:34,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:34,054 INFO L82 PathProgramCache]: Analyzing trace with hash 769876607, now seen corresponding path program 1 times [2018-12-30 23:42:34,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:34,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:34,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:34,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2018-12-30 23:42:34,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:34,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:42:34,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:42:34,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:42:34,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:42:34,474 INFO L87 Difference]: Start difference. First operand 24413 states and 28707 transitions. Second operand 4 states. [2018-12-30 23:42:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:39,769 INFO L93 Difference]: Finished difference Result 57323 states and 67791 transitions. [2018-12-30 23:42:39,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:42:39,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 488 [2018-12-30 23:42:39,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:39,820 INFO L225 Difference]: With dead ends: 57323 [2018-12-30 23:42:39,821 INFO L226 Difference]: Without dead ends: 25659 [2018-12-30 23:42:39,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:42:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25659 states. [2018-12-30 23:42:40,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25659 to 23105. [2018-12-30 23:42:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23105 states. [2018-12-30 23:42:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23105 states to 23105 states and 25912 transitions. [2018-12-30 23:42:40,423 INFO L78 Accepts]: Start accepts. Automaton has 23105 states and 25912 transitions. Word has length 488 [2018-12-30 23:42:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:40,424 INFO L480 AbstractCegarLoop]: Abstraction has 23105 states and 25912 transitions. [2018-12-30 23:42:40,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:42:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23105 states and 25912 transitions. [2018-12-30 23:42:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-12-30 23:42:40,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:40,444 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:40,444 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:40,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:40,446 INFO L82 PathProgramCache]: Analyzing trace with hash 72369002, now seen corresponding path program 1 times [2018-12-30 23:42:40,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:40,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:40,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2018-12-30 23:42:40,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:40,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:42:40,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:42:40,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:42:40,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:40,968 INFO L87 Difference]: Start difference. First operand 23105 states and 25912 transitions. Second operand 3 states. [2018-12-30 23:42:44,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:44,071 INFO L93 Difference]: Finished difference Result 52587 states and 58971 transitions. [2018-12-30 23:42:44,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:42:44,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 540 [2018-12-30 23:42:44,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:44,122 INFO L225 Difference]: With dead ends: 52587 [2018-12-30 23:42:44,122 INFO L226 Difference]: Without dead ends: 30334 [2018-12-30 23:42:44,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30334 states. [2018-12-30 23:42:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30334 to 29056. [2018-12-30 23:42:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29056 states. [2018-12-30 23:42:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29056 states to 29056 states and 32175 transitions. [2018-12-30 23:42:44,494 INFO L78 Accepts]: Start accepts. Automaton has 29056 states and 32175 transitions. Word has length 540 [2018-12-30 23:42:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:44,496 INFO L480 AbstractCegarLoop]: Abstraction has 29056 states and 32175 transitions. [2018-12-30 23:42:44,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:42:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 29056 states and 32175 transitions. [2018-12-30 23:42:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-12-30 23:42:44,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:44,523 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:44,523 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:44,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:44,523 INFO L82 PathProgramCache]: Analyzing trace with hash -517612231, now seen corresponding path program 1 times [2018-12-30 23:42:44,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2018-12-30 23:42:45,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:45,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:42:45,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:42:45,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:42:45,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:45,369 INFO L87 Difference]: Start difference. First operand 29056 states and 32175 transitions. Second operand 3 states. [2018-12-30 23:42:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:48,737 INFO L93 Difference]: Finished difference Result 73425 states and 81091 transitions. [2018-12-30 23:42:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:42:48,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 580 [2018-12-30 23:42:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:48,790 INFO L225 Difference]: With dead ends: 73425 [2018-12-30 23:42:48,790 INFO L226 Difference]: Without dead ends: 44793 [2018-12-30 23:42:48,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44793 states. [2018-12-30 23:42:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44793 to 40952. [2018-12-30 23:42:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40952 states. [2018-12-30 23:42:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40952 states to 40952 states and 45126 transitions. [2018-12-30 23:42:49,341 INFO L78 Accepts]: Start accepts. Automaton has 40952 states and 45126 transitions. Word has length 580 [2018-12-30 23:42:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:49,342 INFO L480 AbstractCegarLoop]: Abstraction has 40952 states and 45126 transitions. [2018-12-30 23:42:49,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:42:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40952 states and 45126 transitions. [2018-12-30 23:42:49,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2018-12-30 23:42:49,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:49,360 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:49,360 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash -682726189, now seen corresponding path program 1 times [2018-12-30 23:42:49,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:49,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1093 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2018-12-30 23:42:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:42:50,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:42:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:42:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:50,157 INFO L87 Difference]: Start difference. First operand 40952 states and 45126 transitions. Second operand 3 states. [2018-12-30 23:42:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:52,444 INFO L93 Difference]: Finished difference Result 87859 states and 96737 transitions. [2018-12-30 23:42:52,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:42:52,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 620 [2018-12-30 23:42:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:52,503 INFO L225 Difference]: With dead ends: 87859 [2018-12-30 23:42:52,503 INFO L226 Difference]: Without dead ends: 47759 [2018-12-30 23:42:52,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:42:52,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47759 states. [2018-12-30 23:42:52,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47759 to 39669. [2018-12-30 23:42:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39669 states. [2018-12-30 23:42:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39669 states to 39669 states and 43687 transitions. [2018-12-30 23:42:53,007 INFO L78 Accepts]: Start accepts. Automaton has 39669 states and 43687 transitions. Word has length 620 [2018-12-30 23:42:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:53,009 INFO L480 AbstractCegarLoop]: Abstraction has 39669 states and 43687 transitions. [2018-12-30 23:42:53,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:42:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 39669 states and 43687 transitions. [2018-12-30 23:42:53,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-12-30 23:42:53,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:53,022 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:53,023 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:53,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:53,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1771694852, now seen corresponding path program 1 times [2018-12-30 23:42:53,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:53,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:53,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-12-30 23:42:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:53,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:42:53,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:42:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:42:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:42:53,625 INFO L87 Difference]: Start difference. First operand 39669 states and 43687 transitions. Second operand 4 states. [2018-12-30 23:42:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:42:57,477 INFO L93 Difference]: Finished difference Result 78055 states and 86055 transitions. [2018-12-30 23:42:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:42:57,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 639 [2018-12-30 23:42:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:42:57,513 INFO L225 Difference]: With dead ends: 78055 [2018-12-30 23:42:57,513 INFO L226 Difference]: Without dead ends: 39238 [2018-12-30 23:42:57,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:42:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39238 states. [2018-12-30 23:42:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39238 to 38386. [2018-12-30 23:42:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38386 states. [2018-12-30 23:42:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38386 states to 38386 states and 41420 transitions. [2018-12-30 23:42:57,943 INFO L78 Accepts]: Start accepts. Automaton has 38386 states and 41420 transitions. Word has length 639 [2018-12-30 23:42:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:42:57,945 INFO L480 AbstractCegarLoop]: Abstraction has 38386 states and 41420 transitions. [2018-12-30 23:42:57,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:42:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 38386 states and 41420 transitions. [2018-12-30 23:42:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2018-12-30 23:42:57,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:42:57,961 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:42:57,961 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:42:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:42:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1109461694, now seen corresponding path program 1 times [2018-12-30 23:42:57,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:42:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:42:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:42:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:42:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:42:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1230 backedges. 703 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2018-12-30 23:42:58,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:42:58,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:42:58,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:42:58,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:42:58,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:42:58,742 INFO L87 Difference]: Start difference. First operand 38386 states and 41420 transitions. Second operand 5 states. [2018-12-30 23:43:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:43:04,853 INFO L93 Difference]: Finished difference Result 85735 states and 93110 transitions. [2018-12-30 23:43:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 23:43:04,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 678 [2018-12-30 23:43:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:43:04,910 INFO L225 Difference]: With dead ends: 85735 [2018-12-30 23:43:04,910 INFO L226 Difference]: Without dead ends: 51607 [2018-12-30 23:43:04,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 23:43:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51607 states. [2018-12-30 23:43:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51607 to 44374. [2018-12-30 23:43:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44374 states. [2018-12-30 23:43:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44374 states to 44374 states and 47983 transitions. [2018-12-30 23:43:05,382 INFO L78 Accepts]: Start accepts. Automaton has 44374 states and 47983 transitions. Word has length 678 [2018-12-30 23:43:05,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:43:05,383 INFO L480 AbstractCegarLoop]: Abstraction has 44374 states and 47983 transitions. [2018-12-30 23:43:05,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:43:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 44374 states and 47983 transitions. [2018-12-30 23:43:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2018-12-30 23:43:05,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:43:05,407 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:43:05,407 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:43:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:43:05,409 INFO L82 PathProgramCache]: Analyzing trace with hash 736192065, now seen corresponding path program 1 times [2018-12-30 23:43:05,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:43:05,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:43:05,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:43:05,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:43:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:43:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:43:06,251 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-12-30 23:43:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 211 proven. 405 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-30 23:43:07,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:43:07,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:43:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:43:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:43:07,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:43:08,341 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2018-12-30 23:43:09,318 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 536 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-30 23:43:09,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-30 23:43:09,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-12-30 23:43:09,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:43:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:43:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:43:09,340 INFO L87 Difference]: Start difference. First operand 44374 states and 47983 transitions. Second operand 8 states. [2018-12-30 23:43:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:43:21,532 INFO L93 Difference]: Finished difference Result 90456 states and 98081 transitions. [2018-12-30 23:43:21,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-30 23:43:21,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 703 [2018-12-30 23:43:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:43:21,583 INFO L225 Difference]: With dead ends: 90456 [2018-12-30 23:43:21,584 INFO L226 Difference]: Without dead ends: 51187 [2018-12-30 23:43:21,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 701 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:43:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51187 states. [2018-12-30 23:43:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51187 to 45217. [2018-12-30 23:43:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45217 states. [2018-12-30 23:43:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45217 states to 45217 states and 48628 transitions. [2018-12-30 23:43:22,031 INFO L78 Accepts]: Start accepts. Automaton has 45217 states and 48628 transitions. Word has length 703 [2018-12-30 23:43:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:43:22,032 INFO L480 AbstractCegarLoop]: Abstraction has 45217 states and 48628 transitions. [2018-12-30 23:43:22,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:43:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 45217 states and 48628 transitions. [2018-12-30 23:43:22,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 721 [2018-12-30 23:43:22,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:43:22,046 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:43:22,047 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:43:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:43:22,048 INFO L82 PathProgramCache]: Analyzing trace with hash 728337234, now seen corresponding path program 1 times [2018-12-30 23:43:22,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:43:22,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:43:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:43:22,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:43:22,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:43:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:43:22,625 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-12-30 23:43:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 345 proven. 672 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-30 23:43:23,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:43:23,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:43:23,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:43:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:43:23,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:43:23,651 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 11 [2018-12-30 23:43:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-12-30 23:43:24,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:43:24,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2018-12-30 23:43:24,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-30 23:43:24,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-30 23:43:24,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:43:24,963 INFO L87 Difference]: Start difference. First operand 45217 states and 48628 transitions. Second operand 9 states. [2018-12-30 23:44:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:16,485 INFO L93 Difference]: Finished difference Result 94266 states and 101358 transitions. [2018-12-30 23:44:16,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:44:16,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 720 [2018-12-30 23:44:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:16,540 INFO L225 Difference]: With dead ends: 94266 [2018-12-30 23:44:16,540 INFO L226 Difference]: Without dead ends: 54582 [2018-12-30 23:44:16,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 718 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:44:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54582 states. [2018-12-30 23:44:17,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54582 to 48619. [2018-12-30 23:44:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48619 states. [2018-12-30 23:44:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48619 states to 48619 states and 52117 transitions. [2018-12-30 23:44:17,270 INFO L78 Accepts]: Start accepts. Automaton has 48619 states and 52117 transitions. Word has length 720 [2018-12-30 23:44:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:17,272 INFO L480 AbstractCegarLoop]: Abstraction has 48619 states and 52117 transitions. [2018-12-30 23:44:17,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-30 23:44:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 48619 states and 52117 transitions. [2018-12-30 23:44:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2018-12-30 23:44:17,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:17,290 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1] [2018-12-30 23:44:17,290 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1029628016, now seen corresponding path program 1 times [2018-12-30 23:44:17,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:17,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:17,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 768 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-12-30 23:44:18,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:18,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:44:18,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:44:18,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:44:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:44:18,105 INFO L87 Difference]: Start difference. First operand 48619 states and 52117 transitions. Second operand 3 states. [2018-12-30 23:44:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:21,083 INFO L93 Difference]: Finished difference Result 101488 states and 108828 transitions. [2018-12-30 23:44:21,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:44:21,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 761 [2018-12-30 23:44:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:21,140 INFO L225 Difference]: With dead ends: 101488 [2018-12-30 23:44:21,140 INFO L226 Difference]: Without dead ends: 53294 [2018-12-30 23:44:21,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:44:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53294 states. [2018-12-30 23:44:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53294 to 49039. [2018-12-30 23:44:21,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49039 states. [2018-12-30 23:44:21,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49039 states to 49039 states and 52060 transitions. [2018-12-30 23:44:21,610 INFO L78 Accepts]: Start accepts. Automaton has 49039 states and 52060 transitions. Word has length 761 [2018-12-30 23:44:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:21,610 INFO L480 AbstractCegarLoop]: Abstraction has 49039 states and 52060 transitions. [2018-12-30 23:44:21,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:44:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 49039 states and 52060 transitions. [2018-12-30 23:44:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2018-12-30 23:44:21,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:21,631 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:44:21,632 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:21,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:21,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1453937331, now seen corresponding path program 1 times [2018-12-30 23:44:21,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:21,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:21,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:21,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1765 backedges. 1253 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-12-30 23:44:23,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:23,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:44:23,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:44:23,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:44:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:23,239 INFO L87 Difference]: Start difference. First operand 49039 states and 52060 transitions. Second operand 5 states. [2018-12-30 23:44:28,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:28,458 INFO L93 Difference]: Finished difference Result 108302 states and 114989 transitions. [2018-12-30 23:44:28,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:44:28,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 818 [2018-12-30 23:44:28,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:28,515 INFO L225 Difference]: With dead ends: 108302 [2018-12-30 23:44:28,515 INFO L226 Difference]: Without dead ends: 64372 [2018-12-30 23:44:28,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64372 states. [2018-12-30 23:44:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64372 to 48632. [2018-12-30 23:44:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48632 states. [2018-12-30 23:44:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48632 states to 48632 states and 51685 transitions. [2018-12-30 23:44:28,987 INFO L78 Accepts]: Start accepts. Automaton has 48632 states and 51685 transitions. Word has length 818 [2018-12-30 23:44:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:28,988 INFO L480 AbstractCegarLoop]: Abstraction has 48632 states and 51685 transitions. [2018-12-30 23:44:28,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:44:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 48632 states and 51685 transitions. [2018-12-30 23:44:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2018-12-30 23:44:29,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:29,010 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:44:29,010 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:29,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:29,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1111320654, now seen corresponding path program 1 times [2018-12-30 23:44:29,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:29,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:29,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:29,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1608 backedges. 1096 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-12-30 23:44:30,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:30,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:44:30,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:44:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:44:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:30,205 INFO L87 Difference]: Start difference. First operand 48632 states and 51685 transitions. Second operand 5 states. [2018-12-30 23:44:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:35,965 INFO L93 Difference]: Finished difference Result 104503 states and 110947 transitions. [2018-12-30 23:44:35,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:44:35,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 828 [2018-12-30 23:44:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:36,022 INFO L225 Difference]: With dead ends: 104503 [2018-12-30 23:44:36,022 INFO L226 Difference]: Without dead ends: 60552 [2018-12-30 23:44:36,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60552 states. [2018-12-30 23:44:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60552 to 47782. [2018-12-30 23:44:36,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47782 states. [2018-12-30 23:44:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47782 states to 47782 states and 50784 transitions. [2018-12-30 23:44:36,517 INFO L78 Accepts]: Start accepts. Automaton has 47782 states and 50784 transitions. Word has length 828 [2018-12-30 23:44:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:36,518 INFO L480 AbstractCegarLoop]: Abstraction has 47782 states and 50784 transitions. [2018-12-30 23:44:36,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:44:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47782 states and 50784 transitions. [2018-12-30 23:44:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2018-12-30 23:44:36,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:36,535 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:44:36,535 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash 211187487, now seen corresponding path program 1 times [2018-12-30 23:44:36,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:36,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:36,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:36,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 1003 proven. 0 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2018-12-30 23:44:37,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:37,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 23:44:37,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:44:37,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:44:37,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:44:37,389 INFO L87 Difference]: Start difference. First operand 47782 states and 50784 transitions. Second operand 3 states. [2018-12-30 23:44:39,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:39,353 INFO L93 Difference]: Finished difference Result 90028 states and 95782 transitions. [2018-12-30 23:44:39,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:44:39,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 841 [2018-12-30 23:44:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:39,394 INFO L225 Difference]: With dead ends: 90028 [2018-12-30 23:44:39,394 INFO L226 Difference]: Without dead ends: 45650 [2018-12-30 23:44:39,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:44:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45650 states. [2018-12-30 23:44:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45650 to 45223. [2018-12-30 23:44:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45223 states. [2018-12-30 23:44:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45223 states to 45223 states and 48041 transitions. [2018-12-30 23:44:39,847 INFO L78 Accepts]: Start accepts. Automaton has 45223 states and 48041 transitions. Word has length 841 [2018-12-30 23:44:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:39,847 INFO L480 AbstractCegarLoop]: Abstraction has 45223 states and 48041 transitions. [2018-12-30 23:44:39,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:44:39,848 INFO L276 IsEmpty]: Start isEmpty. Operand 45223 states and 48041 transitions. [2018-12-30 23:44:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-12-30 23:44:39,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:39,865 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:44:39,866 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:39,866 INFO L82 PathProgramCache]: Analyzing trace with hash 32043245, now seen corresponding path program 1 times [2018-12-30 23:44:39,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:39,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:39,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:39,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:39,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-12-30 23:44:41,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:41,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 23:44:41,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 23:44:41,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 23:44:41,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:44:41,123 INFO L87 Difference]: Start difference. First operand 45223 states and 48041 transitions. Second operand 3 states. [2018-12-30 23:44:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:44,313 INFO L93 Difference]: Finished difference Result 87893 states and 93482 transitions. [2018-12-30 23:44:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 23:44:44,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 883 [2018-12-30 23:44:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:44,355 INFO L225 Difference]: With dead ends: 87893 [2018-12-30 23:44:44,355 INFO L226 Difference]: Without dead ends: 46074 [2018-12-30 23:44:44,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 23:44:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46074 states. [2018-12-30 23:44:44,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46074 to 45648. [2018-12-30 23:44:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45648 states. [2018-12-30 23:44:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45648 states to 45648 states and 48435 transitions. [2018-12-30 23:44:44,799 INFO L78 Accepts]: Start accepts. Automaton has 45648 states and 48435 transitions. Word has length 883 [2018-12-30 23:44:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:44,799 INFO L480 AbstractCegarLoop]: Abstraction has 45648 states and 48435 transitions. [2018-12-30 23:44:44,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 23:44:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 45648 states and 48435 transitions. [2018-12-30 23:44:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-12-30 23:44:44,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:44,817 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-12-30 23:44:44,817 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1969069858, now seen corresponding path program 1 times [2018-12-30 23:44:44,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:44,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1423 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-12-30 23:44:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:46,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:44:46,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:44:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:44:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:46,027 INFO L87 Difference]: Start difference. First operand 45648 states and 48435 transitions. Second operand 5 states. [2018-12-30 23:44:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:51,388 INFO L93 Difference]: Finished difference Result 108766 states and 115722 transitions. [2018-12-30 23:44:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:44:51,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 903 [2018-12-30 23:44:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:51,452 INFO L225 Difference]: With dead ends: 108766 [2018-12-30 23:44:51,452 INFO L226 Difference]: Without dead ends: 66097 [2018-12-30 23:44:51,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66097 states. [2018-12-30 23:44:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66097 to 55458. [2018-12-30 23:44:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55458 states. [2018-12-30 23:44:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55458 states to 55458 states and 58886 transitions. [2018-12-30 23:44:52,305 INFO L78 Accepts]: Start accepts. Automaton has 55458 states and 58886 transitions. Word has length 903 [2018-12-30 23:44:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:52,306 INFO L480 AbstractCegarLoop]: Abstraction has 55458 states and 58886 transitions. [2018-12-30 23:44:52,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:44:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 55458 states and 58886 transitions. [2018-12-30 23:44:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2018-12-30 23:44:52,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:52,325 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2018-12-30 23:44:52,325 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:52,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:52,326 INFO L82 PathProgramCache]: Analyzing trace with hash 337102246, now seen corresponding path program 1 times [2018-12-30 23:44:52,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:52,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:52,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1958 backedges. 968 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-30 23:44:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:44:53,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:44:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:44:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:44:53,378 INFO L87 Difference]: Start difference. First operand 55458 states and 58886 transitions. Second operand 4 states. [2018-12-30 23:44:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:44:57,456 INFO L93 Difference]: Finished difference Result 119864 states and 127071 transitions. [2018-12-30 23:44:57,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:44:57,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 908 [2018-12-30 23:44:57,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:44:57,519 INFO L225 Difference]: With dead ends: 119864 [2018-12-30 23:44:57,519 INFO L226 Difference]: Without dead ends: 67385 [2018-12-30 23:44:57,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:44:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67385 states. [2018-12-30 23:44:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67385 to 57160. [2018-12-30 23:44:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57160 states. [2018-12-30 23:44:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57160 states to 57160 states and 60696 transitions. [2018-12-30 23:44:58,070 INFO L78 Accepts]: Start accepts. Automaton has 57160 states and 60696 transitions. Word has length 908 [2018-12-30 23:44:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:44:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 57160 states and 60696 transitions. [2018-12-30 23:44:58,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:44:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 57160 states and 60696 transitions. [2018-12-30 23:44:58,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 914 [2018-12-30 23:44:58,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:44:58,088 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:44:58,088 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:44:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:44:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1834210275, now seen corresponding path program 1 times [2018-12-30 23:44:58,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:44:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:44:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:44:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:44:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:44:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-12-30 23:44:58,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:44:58,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:44:58,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:44:58,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:44:58,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:44:58,895 INFO L87 Difference]: Start difference. First operand 57160 states and 60696 transitions. Second operand 5 states. [2018-12-30 23:45:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:45:05,886 INFO L93 Difference]: Finished difference Result 120284 states and 127640 transitions. [2018-12-30 23:45:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:45:05,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 913 [2018-12-30 23:45:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:45:05,949 INFO L225 Difference]: With dead ends: 120284 [2018-12-30 23:45:05,949 INFO L226 Difference]: Without dead ends: 66528 [2018-12-30 23:45:05,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:45:06,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66528 states. [2018-12-30 23:45:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66528 to 52039. [2018-12-30 23:45:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52039 states. [2018-12-30 23:45:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52039 states to 52039 states and 55206 transitions. [2018-12-30 23:45:06,498 INFO L78 Accepts]: Start accepts. Automaton has 52039 states and 55206 transitions. Word has length 913 [2018-12-30 23:45:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:45:06,499 INFO L480 AbstractCegarLoop]: Abstraction has 52039 states and 55206 transitions. [2018-12-30 23:45:06,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:45:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 52039 states and 55206 transitions. [2018-12-30 23:45:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2018-12-30 23:45:06,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:45:06,516 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:45:06,516 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:45:06,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:45:06,516 INFO L82 PathProgramCache]: Analyzing trace with hash -479682453, now seen corresponding path program 1 times [2018-12-30 23:45:06,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:45:06,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:45:06,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:06,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:45:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:45:07,261 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-12-30 23:45:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 669 proven. 470 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-12-30 23:45:08,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:45:08,495 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:45:08,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:45:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:45:08,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:45:09,151 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 25 [2018-12-30 23:45:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 722 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-12-30 23:45:10,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:45:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 23:45:10,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:45:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:45:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:45:10,836 INFO L87 Difference]: Start difference. First operand 52039 states and 55206 transitions. Second operand 8 states. [2018-12-30 23:45:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:45:33,613 INFO L93 Difference]: Finished difference Result 124093 states and 131652 transitions. [2018-12-30 23:45:33,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-30 23:45:33,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 918 [2018-12-30 23:45:33,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:45:33,696 INFO L225 Difference]: With dead ends: 124093 [2018-12-30 23:45:33,696 INFO L226 Difference]: Without dead ends: 72905 [2018-12-30 23:45:33,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 943 GetRequests, 926 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-30 23:45:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72905 states. [2018-12-30 23:45:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72905 to 63092. [2018-12-30 23:45:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63092 states. [2018-12-30 23:45:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63092 states to 63092 states and 66500 transitions. [2018-12-30 23:45:34,624 INFO L78 Accepts]: Start accepts. Automaton has 63092 states and 66500 transitions. Word has length 918 [2018-12-30 23:45:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:45:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 63092 states and 66500 transitions. [2018-12-30 23:45:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:45:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 63092 states and 66500 transitions. [2018-12-30 23:45:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2018-12-30 23:45:34,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:45:34,651 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:45:34,652 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:45:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:45:34,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1814922569, now seen corresponding path program 1 times [2018-12-30 23:45:34,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:45:34,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:45:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:34,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:45:34,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:45:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1947 backedges. 1271 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2018-12-30 23:45:35,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:45:35,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:45:35,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:45:35,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:45:35,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:45:35,632 INFO L87 Difference]: Start difference. First operand 63092 states and 66500 transitions. Second operand 5 states. [2018-12-30 23:45:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:45:42,676 INFO L93 Difference]: Finished difference Result 147481 states and 155963 transitions. [2018-12-30 23:45:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:45:42,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1005 [2018-12-30 23:45:42,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:45:42,760 INFO L225 Difference]: With dead ends: 147481 [2018-12-30 23:45:42,760 INFO L226 Difference]: Without dead ends: 87797 [2018-12-30 23:45:42,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:45:42,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87797 states. [2018-12-30 23:45:43,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87797 to 60956. [2018-12-30 23:45:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60956 states. [2018-12-30 23:45:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60956 states to 60956 states and 64324 transitions. [2018-12-30 23:45:43,497 INFO L78 Accepts]: Start accepts. Automaton has 60956 states and 64324 transitions. Word has length 1005 [2018-12-30 23:45:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:45:43,498 INFO L480 AbstractCegarLoop]: Abstraction has 60956 states and 64324 transitions. [2018-12-30 23:45:43,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:45:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 60956 states and 64324 transitions. [2018-12-30 23:45:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2018-12-30 23:45:43,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:45:43,521 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:45:43,521 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:45:43,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:45:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1759486490, now seen corresponding path program 1 times [2018-12-30 23:45:43,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:45:43,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:45:43,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:43,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:45:43,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:45:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1487 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2018-12-30 23:45:44,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:45:44,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:45:44,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:45:44,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:45:44,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:45:44,706 INFO L87 Difference]: Start difference. First operand 60956 states and 64324 transitions. Second operand 5 states. [2018-12-30 23:45:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:45:50,520 INFO L93 Difference]: Finished difference Result 132981 states and 140437 transitions. [2018-12-30 23:45:50,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:45:50,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1101 [2018-12-30 23:45:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:45:50,589 INFO L225 Difference]: With dead ends: 132981 [2018-12-30 23:45:50,589 INFO L226 Difference]: Without dead ends: 75433 [2018-12-30 23:45:50,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:45:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75433 states. [2018-12-30 23:45:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75433 to 56269. [2018-12-30 23:45:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56269 states. [2018-12-30 23:45:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56269 states to 56269 states and 59422 transitions. [2018-12-30 23:45:51,282 INFO L78 Accepts]: Start accepts. Automaton has 56269 states and 59422 transitions. Word has length 1101 [2018-12-30 23:45:51,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:45:51,283 INFO L480 AbstractCegarLoop]: Abstraction has 56269 states and 59422 transitions. [2018-12-30 23:45:51,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:45:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 56269 states and 59422 transitions. [2018-12-30 23:45:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1153 [2018-12-30 23:45:51,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:45:51,309 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 23:45:51,310 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:45:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:45:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1782584157, now seen corresponding path program 1 times [2018-12-30 23:45:51,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:45:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:45:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:51,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:45:51,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:45:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:45:52,173 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2018-12-30 23:45:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 1013 proven. 245 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2018-12-30 23:45:53,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-30 23:45:53,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-30 23:45:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:45:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:45:53,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-30 23:45:56,423 WARN L181 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 395 DAG size of output: 51 [2018-12-30 23:46:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1516 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2018-12-30 23:46:00,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-30 23:46:00,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-12-30 23:46:00,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-30 23:46:00,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-30 23:46:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-30 23:46:00,365 INFO L87 Difference]: Start difference. First operand 56269 states and 59422 transitions. Second operand 8 states. [2018-12-30 23:47:58,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:47:58,931 INFO L93 Difference]: Finished difference Result 132959 states and 140256 transitions. [2018-12-30 23:47:58,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-30 23:47:58,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1152 [2018-12-30 23:47:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:47:59,004 INFO L225 Difference]: With dead ends: 132959 [2018-12-30 23:47:59,004 INFO L226 Difference]: Without dead ends: 77542 [2018-12-30 23:47:59,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1159 GetRequests, 1152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-30 23:47:59,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77542 states. [2018-12-30 23:47:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77542 to 64743. [2018-12-30 23:47:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64743 states. [2018-12-30 23:47:59,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64743 states to 64743 states and 67871 transitions. [2018-12-30 23:47:59,714 INFO L78 Accepts]: Start accepts. Automaton has 64743 states and 67871 transitions. Word has length 1152 [2018-12-30 23:47:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:47:59,715 INFO L480 AbstractCegarLoop]: Abstraction has 64743 states and 67871 transitions. [2018-12-30 23:47:59,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-30 23:47:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 64743 states and 67871 transitions. [2018-12-30 23:47:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1801 [2018-12-30 23:47:59,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:47:59,754 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 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, 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:47:59,754 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:47:59,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:47:59,755 INFO L82 PathProgramCache]: Analyzing trace with hash 833251247, now seen corresponding path program 1 times [2018-12-30 23:47:59,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:47:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:47:59,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:47:59,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:47:59,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:47:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:48:00,667 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 23:48:00,889 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-30 23:48:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4668 backedges. 2255 proven. 0 refuted. 0 times theorem prover too weak. 2413 trivial. 0 not checked. [2018-12-30 23:48:03,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:48:03,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 23:48:03,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 23:48:03,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 23:48:03,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:48:03,170 INFO L87 Difference]: Start difference. First operand 64743 states and 67871 transitions. Second operand 4 states. [2018-12-30 23:48:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:48:07,507 INFO L93 Difference]: Finished difference Result 125638 states and 131201 transitions. [2018-12-30 23:48:07,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 23:48:07,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1800 [2018-12-30 23:48:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:48:07,567 INFO L225 Difference]: With dead ends: 125638 [2018-12-30 23:48:07,567 INFO L226 Difference]: Without dead ends: 62597 [2018-12-30 23:48:07,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 23:48:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62597 states. [2018-12-30 23:48:08,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62597 to 54931. [2018-12-30 23:48:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54931 states. [2018-12-30 23:48:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54931 states to 54931 states and 57021 transitions. [2018-12-30 23:48:08,216 INFO L78 Accepts]: Start accepts. Automaton has 54931 states and 57021 transitions. Word has length 1800 [2018-12-30 23:48:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:48:08,218 INFO L480 AbstractCegarLoop]: Abstraction has 54931 states and 57021 transitions. [2018-12-30 23:48:08,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 23:48:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 54931 states and 57021 transitions. [2018-12-30 23:48:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1987 [2018-12-30 23:48:08,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:48:08,266 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 23:48:08,266 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:48:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:48:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1972589125, now seen corresponding path program 1 times [2018-12-30 23:48:08,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:48:08,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:48:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:48:08,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:48:08,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:48:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:48:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5896 backedges. 3349 proven. 0 refuted. 0 times theorem prover too weak. 2547 trivial. 0 not checked. [2018-12-30 23:48:11,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:48:11,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:48:11,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:48:11,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:48:11,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:48:11,073 INFO L87 Difference]: Start difference. First operand 54931 states and 57021 transitions. Second operand 5 states. [2018-12-30 23:48:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:48:15,741 INFO L93 Difference]: Finished difference Result 109430 states and 113521 transitions. [2018-12-30 23:48:15,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:48:15,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1986 [2018-12-30 23:48:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:48:15,795 INFO L225 Difference]: With dead ends: 109430 [2018-12-30 23:48:15,795 INFO L226 Difference]: Without dead ends: 57903 [2018-12-30 23:48:15,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:48:15,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57903 states. [2018-12-30 23:48:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57903 to 54500. [2018-12-30 23:48:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54500 states. [2018-12-30 23:48:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54500 states to 54500 states and 56413 transitions. [2018-12-30 23:48:16,686 INFO L78 Accepts]: Start accepts. Automaton has 54500 states and 56413 transitions. Word has length 1986 [2018-12-30 23:48:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:48:16,688 INFO L480 AbstractCegarLoop]: Abstraction has 54500 states and 56413 transitions. [2018-12-30 23:48:16,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:48:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 54500 states and 56413 transitions. [2018-12-30 23:48:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2288 [2018-12-30 23:48:16,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 23:48:16,742 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-30 23:48:16,742 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 23:48:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 23:48:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -190837525, now seen corresponding path program 1 times [2018-12-30 23:48:16,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 23:48:16,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 23:48:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:48:16,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 23:48:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 23:48:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 23:48:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7517 backedges. 5804 proven. 0 refuted. 0 times theorem prover too weak. 1713 trivial. 0 not checked. [2018-12-30 23:48:21,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 23:48:21,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 23:48:21,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-30 23:48:21,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-30 23:48:21,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:48:21,095 INFO L87 Difference]: Start difference. First operand 54500 states and 56413 transitions. Second operand 5 states. [2018-12-30 23:48:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 23:48:25,973 INFO L93 Difference]: Finished difference Result 112397 states and 116521 transitions. [2018-12-30 23:48:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 23:48:25,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2287 [2018-12-30 23:48:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 23:48:25,976 INFO L225 Difference]: With dead ends: 112397 [2018-12-30 23:48:25,976 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 23:48:26,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-30 23:48:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 23:48:26,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 23:48:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 23:48:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 23:48:26,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2287 [2018-12-30 23:48:26,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 23:48:26,008 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 23:48:26,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-30 23:48:26,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 23:48:26,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 23:48:26,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 23:48:26,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:26,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:27,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,597 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:28,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:29,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,340 WARN L181 SmtUtils]: Spent 4.32 s on a formula simplification. DAG size of input: 1373 DAG size of output: 1058 [2018-12-30 23:48:30,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,579 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:30,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:31,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,505 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:32,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,483 WARN L181 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 1373 DAG size of output: 1058 [2018-12-30 23:48:33,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,831 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:33,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:34,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,469 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:35,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:36,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:36,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:36,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:36,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 23:48:36,709 WARN L181 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 1373 DAG size of output: 1058 [2018-12-30 23:48:50,821 WARN L181 SmtUtils]: Spent 14.10 s on a formula simplification. DAG size of input: 999 DAG size of output: 159 [2018-12-30 23:49:08,193 WARN L181 SmtUtils]: Spent 17.36 s on a formula simplification. DAG size of input: 999 DAG size of output: 159 [2018-12-30 23:49:24,817 WARN L181 SmtUtils]: Spent 16.62 s on a formula simplification. DAG size of input: 999 DAG size of output: 159 [2018-12-30 23:49:24,821 INFO L448 ceAbstractionStarter]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2018-12-30 23:49:24,821 INFO L448 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2018-12-30 23:49:24,821 INFO L448 ceAbstractionStarter]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 377) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2018-12-30 23:49:24,822 INFO L448 ceAbstractionStarter]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 908) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,823 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,824 INFO L448 ceAbstractionStarter]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,825 INFO L448 ceAbstractionStarter]: For program point L113(line 113) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,826 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,827 INFO L448 ceAbstractionStarter]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,828 INFO L448 ceAbstractionStarter]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 173) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-12-30 23:49:24,829 INFO L448 ceAbstractionStarter]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,830 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 531) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L920(lines 920 929) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2018-12-30 23:49:24,831 INFO L448 ceAbstractionStarter]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,832 INFO L448 ceAbstractionStarter]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L131(line 131) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,833 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-12-30 23:49:24,834 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,835 INFO L448 ceAbstractionStarter]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,835 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,835 INFO L448 ceAbstractionStarter]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,835 INFO L448 ceAbstractionStarter]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,835 INFO L448 ceAbstractionStarter]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,836 INFO L448 ceAbstractionStarter]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,836 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,836 INFO L448 ceAbstractionStarter]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,836 INFO L448 ceAbstractionStarter]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2018-12-30 23:49:24,837 INFO L448 ceAbstractionStarter]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L406(lines 406 415) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2018-12-30 23:49:24,839 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 286) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2018-12-30 23:49:24,840 INFO L448 ceAbstractionStarter]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,841 INFO L448 ceAbstractionStarter]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 557) no Hoare annotation was computed. [2018-12-30 23:49:24,842 INFO L448 ceAbstractionStarter]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,843 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2018-12-30 23:49:24,844 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 697) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,845 INFO L448 ceAbstractionStarter]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,847 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 23:49:24,847 INFO L448 ceAbstractionStarter]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,847 INFO L448 ceAbstractionStarter]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,847 INFO L448 ceAbstractionStarter]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,847 INFO L448 ceAbstractionStarter]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,847 INFO L448 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,848 INFO L448 ceAbstractionStarter]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,849 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-30 23:49:24,850 INFO L448 ceAbstractionStarter]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,851 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,854 INFO L448 ceAbstractionStarter]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L838(lines 838 846) no Hoare annotation was computed. [2018-12-30 23:49:24,855 INFO L448 ceAbstractionStarter]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,856 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L710(lines 710 718) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-12-30 23:49:24,857 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,858 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L53(line 53) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L848(lines 848 858) no Hoare annotation was computed. [2018-12-30 23:49:24,859 INFO L448 ceAbstractionStarter]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L56(line 56) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2018-12-30 23:49:24,860 INFO L448 ceAbstractionStarter]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2018-12-30 23:49:24,862 INFO L444 ceAbstractionStarter]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse26 (+ ~a14~0 182))) (let ((.cse10 (= 2 ~a24~0)) (.cse12 (<= .cse26 0)) (.cse25 (+ ~a14~0 114)) (.cse22 (< 124 ~a26~0)) (.cse11 (<= (+ ~a26~0 68) 0)) (.cse13 (< 0 .cse26))) (let ((.cse3 (<= 183 ~a28~0)) (.cse8 (or .cse22 .cse11 .cse13)) (.cse1 (<= ~a26~0 600058)) (.cse6 (= ~a24~0 1)) (.cse17 (< 0 .cse25)) (.cse7 (<= (+ ~a14~0 84) 0)) (.cse5 (<= ~a28~0 300)) (.cse15 (<= .cse25 0)) (.cse20 (< 37 ~a28~0)) (.cse9 (<= ~a28~0 653924)) (.cse16 (= 3 ~a24~0)) (.cse2 (<= 0 (+ ~a14~0 460126))) (.cse19 (<= ~a26~0 217)) (.cse0 (and .cse10 .cse12)) (.cse18 (<= 125 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 279) .cse3 .cse4) (and .cse5 (and .cse6 .cse7)) (and .cse6 .cse8 .cse7) (and (<= ~a26~0 599553) .cse9 .cse10 .cse4) (and (and (and .cse11 .cse12) .cse4) .cse9) (and .cse3 (and .cse13 (and .cse9 (and (exists ((v_prenex_12 Int)) (let ((.cse14 (mod v_prenex_12 95))) (and (<= (+ v_prenex_12 68) 0) (<= ~a26~0 (+ .cse14 121)) (= 0 .cse14)))) .cse15 .cse16) .cse4))) (and .cse1 .cse5 .cse17 .cse10 .cse4) (and (and .cse18 .cse19 .cse7 .cse4 .cse10) .cse17) (and .cse6 .cse8 (<= ~a26~0 169)) (and .cse2 (and .cse1 .cse10 .cse20 .cse4) (<= ~a28~0 134) .cse12) (and (exists ((v_prenex_1 Int)) (let ((.cse21 (div (+ v_prenex_1 (- 600036)) 5))) (and (= 0 (mod (+ v_prenex_1 4) 5)) (= 0 (mod .cse21 5)) (<= v_prenex_1 111) (<= ~a28~0 (div .cse21 5))))) .cse6 (<= ~a21~0 127)) (and .cse22 .cse6 .cse19) (and (and (and .cse5 .cse7) (<= (+ ~a26~0 40337) 0) .cse4) .cse20) (let ((.cse23 (+ ~a14~0 79))) (and (<= .cse23 0) (<= 222 ~a26~0) .cse4 (<= ~a26~0 222) .cse6 (<= ~a28~0 111) (<= 0 .cse23) (<= 111 ~a28~0))) (or (and (and (<= ~a24~0 2) (exists ((v_prenex_10 Int)) (let ((.cse24 (* 9 v_prenex_10))) (and (<= 0 .cse24) (<= (+ ~a26~0 554854) (div .cse24 10)) (<= v_prenex_10 222) (<= 222 v_prenex_10)))) .cse17 .cse7) .cse4) (and (and .cse11 .cse10) .cse17 .cse7 .cse4)) (and .cse9 (and (and (not .cse16) .cse11) .cse4)) (and (and .cse5 (and .cse11 .cse15 .cse4)) .cse20) (and (and (<= 38 ~a28~0) (and .cse9 .cse16 (<= ~a26~0 120) .cse12 .cse4)) .cse2) (and (and .cse19 (and .cse0 .cse18)) .cse4))))) [2018-12-30 23:49:24,862 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 23:49:24,862 INFO L448 ceAbstractionStarter]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,862 INFO L448 ceAbstractionStarter]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,862 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L59(line 59) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,863 INFO L444 ceAbstractionStarter]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse26 (+ ~a14~0 182))) (let ((.cse10 (= 2 ~a24~0)) (.cse12 (<= .cse26 0)) (.cse25 (+ ~a14~0 114)) (.cse22 (< 124 ~a26~0)) (.cse11 (<= (+ ~a26~0 68) 0)) (.cse13 (< 0 .cse26))) (let ((.cse3 (<= 183 ~a28~0)) (.cse8 (or .cse22 .cse11 .cse13)) (.cse1 (<= ~a26~0 600058)) (.cse6 (= ~a24~0 1)) (.cse17 (< 0 .cse25)) (.cse7 (<= (+ ~a14~0 84) 0)) (.cse5 (<= ~a28~0 300)) (.cse15 (<= .cse25 0)) (.cse20 (< 37 ~a28~0)) (.cse9 (<= ~a28~0 653924)) (.cse16 (= 3 ~a24~0)) (.cse2 (<= 0 (+ ~a14~0 460126))) (.cse19 (<= ~a26~0 217)) (.cse0 (and .cse10 .cse12)) (.cse18 (<= 125 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 279) .cse3 .cse4) (and .cse5 (and .cse6 .cse7)) (and .cse6 .cse8 .cse7) (and (<= ~a26~0 599553) .cse9 .cse10 .cse4) (and (and (and .cse11 .cse12) .cse4) .cse9) (and .cse3 (and .cse13 (and .cse9 (and (exists ((v_prenex_12 Int)) (let ((.cse14 (mod v_prenex_12 95))) (and (<= (+ v_prenex_12 68) 0) (<= ~a26~0 (+ .cse14 121)) (= 0 .cse14)))) .cse15 .cse16) .cse4))) (and .cse1 .cse5 .cse17 .cse10 .cse4) (and (and .cse18 .cse19 .cse7 .cse4 .cse10) .cse17) (and .cse6 .cse8 (<= ~a26~0 169)) (and .cse2 (and .cse1 .cse10 .cse20 .cse4) (<= ~a28~0 134) .cse12) (and (exists ((v_prenex_1 Int)) (let ((.cse21 (div (+ v_prenex_1 (- 600036)) 5))) (and (= 0 (mod (+ v_prenex_1 4) 5)) (= 0 (mod .cse21 5)) (<= v_prenex_1 111) (<= ~a28~0 (div .cse21 5))))) .cse6 (<= ~a21~0 127)) (and .cse22 .cse6 .cse19) (and (and (and .cse5 .cse7) (<= (+ ~a26~0 40337) 0) .cse4) .cse20) (let ((.cse23 (+ ~a14~0 79))) (and (<= .cse23 0) (<= 222 ~a26~0) .cse4 (<= ~a26~0 222) .cse6 (<= ~a28~0 111) (<= 0 .cse23) (<= 111 ~a28~0))) (or (and (and (<= ~a24~0 2) (exists ((v_prenex_10 Int)) (let ((.cse24 (* 9 v_prenex_10))) (and (<= 0 .cse24) (<= (+ ~a26~0 554854) (div .cse24 10)) (<= v_prenex_10 222) (<= 222 v_prenex_10)))) .cse17 .cse7) .cse4) (and (and .cse11 .cse10) .cse17 .cse7 .cse4)) (and .cse9 (and (and (not .cse16) .cse11) .cse4)) (and (and .cse5 (and .cse11 .cse15 .cse4)) .cse20) (and (and (<= 38 ~a28~0) (and .cse9 .cse16 (<= ~a26~0 120) .cse12 .cse4)) .cse2) (and (and .cse19 (and .cse0 .cse18)) .cse4))))) [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L62(line 62) no Hoare annotation was computed. [2018-12-30 23:49:24,864 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L451 ceAbstractionStarter]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L65(line 65) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L726(lines 726 736) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,865 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,866 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-12-30 23:49:24,867 INFO L448 ceAbstractionStarter]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,867 INFO L448 ceAbstractionStarter]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L444 ceAbstractionStarter]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse26 (+ ~a14~0 182))) (let ((.cse10 (= 2 ~a24~0)) (.cse12 (<= .cse26 0)) (.cse25 (+ ~a14~0 114)) (.cse22 (< 124 ~a26~0)) (.cse11 (<= (+ ~a26~0 68) 0)) (.cse13 (< 0 .cse26))) (let ((.cse3 (<= 183 ~a28~0)) (.cse8 (or .cse22 .cse11 .cse13)) (.cse1 (<= ~a26~0 600058)) (.cse6 (= ~a24~0 1)) (.cse17 (< 0 .cse25)) (.cse7 (<= (+ ~a14~0 84) 0)) (.cse5 (<= ~a28~0 300)) (.cse15 (<= .cse25 0)) (.cse20 (< 37 ~a28~0)) (.cse9 (<= ~a28~0 653924)) (.cse16 (= 3 ~a24~0)) (.cse2 (<= 0 (+ ~a14~0 460126))) (.cse19 (<= ~a26~0 217)) (.cse0 (and .cse10 .cse12)) (.cse18 (<= 125 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 .cse2 (<= ~a28~0 279) .cse3 .cse4) (and .cse5 (and .cse6 .cse7)) (and .cse6 .cse8 .cse7) (and (<= ~a26~0 599553) .cse9 .cse10 .cse4) (and (and (and .cse11 .cse12) .cse4) .cse9) (and .cse3 (and .cse13 (and .cse9 (and (exists ((v_prenex_12 Int)) (let ((.cse14 (mod v_prenex_12 95))) (and (<= (+ v_prenex_12 68) 0) (<= ~a26~0 (+ .cse14 121)) (= 0 .cse14)))) .cse15 .cse16) .cse4))) (and .cse1 .cse5 .cse17 .cse10 .cse4) (and (and .cse18 .cse19 .cse7 .cse4 .cse10) .cse17) (and .cse6 .cse8 (<= ~a26~0 169)) (and .cse2 (and .cse1 .cse10 .cse20 .cse4) (<= ~a28~0 134) .cse12) (and (exists ((v_prenex_1 Int)) (let ((.cse21 (div (+ v_prenex_1 (- 600036)) 5))) (and (= 0 (mod (+ v_prenex_1 4) 5)) (= 0 (mod .cse21 5)) (<= v_prenex_1 111) (<= ~a28~0 (div .cse21 5))))) .cse6 (<= ~a21~0 127)) (and .cse22 .cse6 .cse19) (and (and (and .cse5 .cse7) (<= (+ ~a26~0 40337) 0) .cse4) .cse20) (let ((.cse23 (+ ~a14~0 79))) (and (<= .cse23 0) (<= 222 ~a26~0) .cse4 (<= ~a26~0 222) .cse6 (<= ~a28~0 111) (<= 0 .cse23) (<= 111 ~a28~0))) (or (and (and (<= ~a24~0 2) (exists ((v_prenex_10 Int)) (let ((.cse24 (* 9 v_prenex_10))) (and (<= 0 .cse24) (<= (+ ~a26~0 554854) (div .cse24 10)) (<= v_prenex_10 222) (<= 222 v_prenex_10)))) .cse17 .cse7) .cse4) (and (and .cse11 .cse10) .cse17 .cse7 .cse4)) (and .cse9 (and (and (not .cse16) .cse11) .cse4)) (and (and .cse5 (and .cse11 .cse15 .cse4)) .cse20) (and (and (<= 38 ~a28~0) (and .cse9 .cse16 (<= ~a26~0 120) .cse12 .cse4)) .cse2) (and (and .cse19 (and .cse0 .cse18)) .cse4))))) [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,868 INFO L448 ceAbstractionStarter]: For program point L71(line 71) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 605) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,869 INFO L448 ceAbstractionStarter]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L206(line 206) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2018-12-30 23:49:24,870 INFO L448 ceAbstractionStarter]: For program point L2585(line 2585) no Hoare annotation was computed. [2018-12-30 23:49:24,873 INFO L448 ceAbstractionStarter]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2018-12-30 23:49:24,873 INFO L448 ceAbstractionStarter]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,873 INFO L448 ceAbstractionStarter]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L77(line 77) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,874 INFO L448 ceAbstractionStarter]: For program point L607(lines 607 617) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,875 INFO L448 ceAbstractionStarter]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,876 INFO L448 ceAbstractionStarter]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,886 INFO L448 ceAbstractionStarter]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L749(lines 749 760) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L89(line 89) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,887 INFO L448 ceAbstractionStarter]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,888 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,888 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,888 INFO L448 ceAbstractionStarter]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,888 INFO L448 ceAbstractionStarter]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,888 INFO L448 ceAbstractionStarter]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,888 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2018-12-30 23:49:24,896 INFO L448 ceAbstractionStarter]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,897 INFO L448 ceAbstractionStarter]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,898 INFO L448 ceAbstractionStarter]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2018-12-30 23:49:24,898 INFO L448 ceAbstractionStarter]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2018-12-30 23:49:24,898 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,898 INFO L448 ceAbstractionStarter]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,898 INFO L448 ceAbstractionStarter]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,906 INFO L448 ceAbstractionStarter]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,906 INFO L448 ceAbstractionStarter]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2018-12-30 23:49:24,906 INFO L448 ceAbstractionStarter]: For program point L626(lines 626 633) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2018-12-30 23:49:24,907 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-12-30 23:49:24,928 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,933 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,933 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,934 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,967 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,988 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:24,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:24,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:24,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 11:49:25 BoogieIcfgContainer [2018-12-30 23:49:25,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 23:49:25,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 23:49:25,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 23:49:25,016 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 23:49:25,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 11:41:29" (3/4) ... [2018-12-30 23:49:25,022 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 23:49:25,089 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-30 23:49:25,094 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 23:49:25,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || (((a26 <= 599553 && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (183 <= a28 && 0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) || ((((a26 + 68 <= 0 && 2 == a24) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((38 <= a28 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 0 <= a14 + 460126)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) [2018-12-30 23:49:25,146 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || (((a26 <= 599553 && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (183 <= a28 && 0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) || ((((a26 + 68 <= 0 && 2 == a24) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((38 <= a28 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 0 <= a14 + 460126)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) [2018-12-30 23:49:25,167 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || (((a26 <= 599553 && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (183 <= a28 && 0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) || ((((a26 + 68 <= 0 && 2 == a24) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((38 <= a28 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 0 <= a14 + 460126)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) [2018-12-30 23:49:25,531 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 23:49:25,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 23:49:25,533 INFO L168 Benchmark]: Toolchain (without parser) took 486218.92 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 940.5 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,533 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 23:49:25,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1664.23 ms. Allocated memory is still 1.0 GB. Free memory was 940.5 MB in the beginning and 800.9 MB in the end (delta: 139.6 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 477.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 800.9 MB in the beginning and 1.1 GB in the end (delta: -260.5 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,534 INFO L168 Benchmark]: Boogie Preprocessor took 294.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,535 INFO L168 Benchmark]: RCFGBuilder took 8150.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.0 GB in the beginning and 990.8 MB in the end (delta: 39.7 MB). Peak memory consumption was 290.5 MB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,535 INFO L168 Benchmark]: TraceAbstraction took 475109.88 ms. Allocated memory was 1.3 GB in the beginning and 4.8 GB in the end (delta: 3.5 GB). Free memory was 990.8 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,535 INFO L168 Benchmark]: Witness Printer took 515.76 ms. Allocated memory is still 4.8 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. [2018-12-30 23:49:25,538 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1664.23 ms. Allocated memory is still 1.0 GB. Free memory was 940.5 MB in the beginning and 800.9 MB in the end (delta: 139.6 MB). Peak memory consumption was 139.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 477.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 800.9 MB in the beginning and 1.1 GB in the end (delta: -260.5 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 294.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 8150.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.2 MB). Free memory was 1.0 GB in the beginning and 990.8 MB in the end (delta: 39.7 MB). Peak memory consumption was 290.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 475109.88 ms. Allocated memory was 1.3 GB in the beginning and 4.8 GB in the end (delta: 3.5 GB). Free memory was 990.8 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 515.76 ms. Allocated memory is still 4.8 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 75.2 MB). Peak memory consumption was 75.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 173]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2018-12-30 23:49:25,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || (((a26 <= 599553 && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (183 <= a28 && 0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) || ((((a26 + 68 <= 0 && 2 == a24) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((38 <= a28 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 0 <= a14 + 460126)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) - InvariantResult [Line: 1646]: Loop Invariant [2018-12-30 23:49:25,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,550 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || (((a26 <= 599553 && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (183 <= a28 && 0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) || ((((a26 + 68 <= 0 && 2 == a24) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((38 <= a28 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 0 <= a14 + 460126)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) - InvariantResult [Line: 24]: Loop Invariant [2018-12-30 23:49:25,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-30 23:49:25,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-12-30 23:49:25,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-30 23:49:25,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((2 == a24 && a14 + 182 <= 0) && a26 <= 600058) && 0 <= a14 + 460126) && a28 <= 279) && 183 <= a28) && a21 <= 124) || (a28 <= 300 && a24 == 1 && a14 + 84 <= 0)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a14 + 84 <= 0)) || (((a26 <= 599553 && a28 <= 653924) && 2 == a24) && a21 <= 124)) || (((a26 + 68 <= 0 && a14 + 182 <= 0) && a21 <= 124) && a28 <= 653924)) || (183 <= a28 && 0 < a14 + 182 && (a28 <= 653924 && ((\exists v_prenex_12 : int :: (v_prenex_12 + 68 <= 0 && a26 <= v_prenex_12 % 95 + 121) && 0 == v_prenex_12 % 95) && a14 + 114 <= 0) && 3 == a24) && a21 <= 124)) || ((((a26 <= 600058 && a28 <= 300) && 0 < a14 + 114) && 2 == a24) && a21 <= 124)) || (((((125 <= a26 && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124) && 2 == a24) && 0 < a14 + 114)) || ((a24 == 1 && ((124 < a26 || a26 + 68 <= 0) || 0 < a14 + 182)) && a26 <= 169)) || (((0 <= a14 + 460126 && ((a26 <= 600058 && 2 == a24) && 37 < a28) && a21 <= 124) && a28 <= 134) && a14 + 182 <= 0)) || (((\exists v_prenex_1 : int :: ((0 == (v_prenex_1 + 4) % 5 && 0 == (v_prenex_1 + -600036) / 5 % 5) && v_prenex_1 <= 111) && a28 <= (v_prenex_1 + -600036) / 5 / 5) && a24 == 1) && a21 <= 127)) || ((124 < a26 && a24 == 1) && a26 <= 217)) || ((((a28 <= 300 && a14 + 84 <= 0) && a26 + 40337 <= 0) && a21 <= 124) && 37 < a28)) || (((((((a14 + 79 <= 0 && 222 <= a26) && a21 <= 124) && a26 <= 222) && a24 == 1) && a28 <= 111) && 0 <= a14 + 79) && 111 <= a28)) || ((((a24 <= 2 && (\exists v_prenex_10 : int :: ((0 <= 9 * v_prenex_10 && a26 + 554854 <= 9 * v_prenex_10 / 10) && v_prenex_10 <= 222) && 222 <= v_prenex_10)) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124) || ((((a26 + 68 <= 0 && 2 == a24) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (a28 <= 653924 && (!(3 == a24) && a26 + 68 <= 0) && a21 <= 124)) || ((a28 <= 300 && (a26 + 68 <= 0 && a14 + 114 <= 0) && a21 <= 124) && 37 < a28)) || ((38 <= a28 && (((a28 <= 653924 && 3 == a24) && a26 <= 120) && a14 + 182 <= 0) && a21 <= 124) && 0 <= a14 + 460126)) || ((a26 <= 217 && (2 == a24 && a14 + 182 <= 0) && 125 <= a26) && a21 <= 124) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. SAFE Result, 474.9s OverallTime, 28 OverallIterations, 11 TraceHistogramMax, 350.6s AutomataDifference, 0.0s DeadEndRemovalTime, 58.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 8116 SDtfs, 42624 SDslu, 3462 SDs, 0 SdLazy, 105506 SolverSat, 13734 SolverUnsat, 102 SolverUnknown, 0 SolverNotchecked, 311.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4519 GetRequests, 4402 SyntacticMatches, 10 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64743occurred in iteration=25, 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: 13.5s AutomataMinimizationTime, 28 MinimizatonAttempts, 194280 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 544 NumberOfFragments, 1447 HoareAnnotationTreeSize, 4 FomulaSimplifications, 275339721 FormulaSimplificationTreeSizeReduction, 10.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 81144819 FormulaSimplificationTreeSizeReductionInter, 48.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 26.6s InterpolantComputationTime, 27563 NumberOfCodeBlocks, 27563 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 27528 ConstructedInterpolants, 924 QuantifiedInterpolants, 100678467 SizeOfPredicates, 5 NumberOfNonLiveVariables, 5312 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 35 InterpolantComputations, 24 PerfectInterpolantSequences, 50182/52641 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...