./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/eca-rers2012/Problem14_label59.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 f418d82fd3ea296ff0e64793b35fd062187cf0a9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:11:40,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:11:40,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:11:40,297 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:11:40,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:11:40,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:11:40,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:11:40,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:11:40,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:11:40,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:11:40,321 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:11:40,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:11:40,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:11:40,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:11:40,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:11:40,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:11:40,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:11:40,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:11:40,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:11:40,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:11:40,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:11:40,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:11:40,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:11:40,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:11:40,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:11:40,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:11:40,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:11:40,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:11:40,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:11:40,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:11:40,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:11:40,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:11:40,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:11:40,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:11:40,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:11:40,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:11:40,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:11:40,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:11:40,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:11:40,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:11:40,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:11:40,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:11:40,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:11:40,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:11:40,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:11:40,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:11:40,414 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:11:40,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:11:40,415 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:11:40,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:11:40,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:11:40,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:11:40,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:11:40,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:11:40,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:11:40,417 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:11:40,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:11:40,418 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:11:40,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:11:40,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:11:40,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:11:40,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:11:40,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:11:40,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:11:40,420 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:11:40,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:11:40,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:11:40,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:11:40,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:11:40,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:11:40,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> f418d82fd3ea296ff0e64793b35fd062187cf0a9 [2019-11-27 23:11:40,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:11:40,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:11:40,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:11:40,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:11:40,750 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:11:40,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label59.c [2019-11-27 23:11:40,820 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966c6f5a1/e431f85dad6c45958c36e04567683dda/FLAGa2af462fb [2019-11-27 23:11:41,404 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:11:41,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label59.c [2019-11-27 23:11:41,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966c6f5a1/e431f85dad6c45958c36e04567683dda/FLAGa2af462fb [2019-11-27 23:11:41,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966c6f5a1/e431f85dad6c45958c36e04567683dda [2019-11-27 23:11:41,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:11:41,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:11:41,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:11:41,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:11:41,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:11:41,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:11:41" (1/1) ... [2019-11-27 23:11:41,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:41, skipping insertion in model container [2019-11-27 23:11:41,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:11:41" (1/1) ... [2019-11-27 23:11:41,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:11:41,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:11:42,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:11:42,286 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:11:42,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:11:42,491 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:11:42,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42 WrapperNode [2019-11-27 23:11:42,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:11:42,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:11:42,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:11:42,494 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:11:42,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:11:42,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:11:42,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:11:42,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:11:42,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,725 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... [2019-11-27 23:11:42,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:11:42,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:11:42,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:11:42,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:11:42,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:11:42,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:11:42,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:11:44,716 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:11:44,717 INFO L297 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-27 23:11:44,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:11:44 BoogieIcfgContainer [2019-11-27 23:11:44,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:11:44,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:11:44,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:11:44,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:11:44,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:11:41" (1/3) ... [2019-11-27 23:11:44,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5717a38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:11:44, skipping insertion in model container [2019-11-27 23:11:44,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:11:42" (2/3) ... [2019-11-27 23:11:44,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5717a38c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:11:44, skipping insertion in model container [2019-11-27 23:11:44,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:11:44" (3/3) ... [2019-11-27 23:11:44,729 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label59.c [2019-11-27 23:11:44,742 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:11:44,751 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:11:44,766 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:11:44,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:11:44,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:11:44,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:11:44,806 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:11:44,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:11:44,806 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:11:44,807 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:11:44,808 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:11:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-27 23:11:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-27 23:11:44,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:44,860 INFO L410 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] [2019-11-27 23:11:44,861 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2102454322, now seen corresponding path program 1 times [2019-11-27 23:11:44,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:44,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522110716] [2019-11-27 23:11:44,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:11:45,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522110716] [2019-11-27 23:11:45,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:11:45,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:11:45,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805986455] [2019-11-27 23:11:45,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:11:45,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:45,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:11:45,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:11:45,290 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-27 23:11:47,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:47,538 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-27 23:11:47,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:11:47,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-11-27 23:11:47,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:47,562 INFO L225 Difference]: With dead ends: 850 [2019-11-27 23:11:47,562 INFO L226 Difference]: Without dead ends: 538 [2019-11-27 23:11:47,567 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:11:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-27 23:11:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-27 23:11:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-27 23:11:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 814 transitions. [2019-11-27 23:11:47,649 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 814 transitions. Word has length 40 [2019-11-27 23:11:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:47,649 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 814 transitions. [2019-11-27 23:11:47,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:11:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 814 transitions. [2019-11-27 23:11:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-27 23:11:47,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:47,654 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:11:47,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 335241793, now seen corresponding path program 1 times [2019-11-27 23:11:47,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:47,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662326205] [2019-11-27 23:11:47,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:11:47,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662326205] [2019-11-27 23:11:47,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:11:47,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:11:47,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145242082] [2019-11-27 23:11:47,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:11:47,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:47,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:11:47,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:11:47,771 INFO L87 Difference]: Start difference. First operand 538 states and 814 transitions. Second operand 4 states. [2019-11-27 23:11:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:49,213 INFO L93 Difference]: Finished difference Result 2142 states and 3248 transitions. [2019-11-27 23:11:49,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:11:49,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-11-27 23:11:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:49,226 INFO L225 Difference]: With dead ends: 2142 [2019-11-27 23:11:49,226 INFO L226 Difference]: Without dead ends: 1606 [2019-11-27 23:11:49,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:11:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-27 23:11:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-27 23:11:49,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-27 23:11:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1982 transitions. [2019-11-27 23:11:49,292 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1982 transitions. Word has length 106 [2019-11-27 23:11:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:49,293 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 1982 transitions. [2019-11-27 23:11:49,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:11:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1982 transitions. [2019-11-27 23:11:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-27 23:11:49,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:49,297 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:11:49,298 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1532171556, now seen corresponding path program 1 times [2019-11-27 23:11:49,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:49,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332579725] [2019-11-27 23:11:49,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:11:49,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332579725] [2019-11-27 23:11:49,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:11:49,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:11:49,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513611665] [2019-11-27 23:11:49,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:11:49,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:11:49,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:11:49,405 INFO L87 Difference]: Start difference. First operand 1428 states and 1982 transitions. Second operand 4 states. [2019-11-27 23:11:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:50,812 INFO L93 Difference]: Finished difference Result 4458 states and 6113 transitions. [2019-11-27 23:11:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:11:50,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-27 23:11:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:50,829 INFO L225 Difference]: With dead ends: 4458 [2019-11-27 23:11:50,830 INFO L226 Difference]: Without dead ends: 3032 [2019-11-27 23:11:50,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:11:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-11-27 23:11:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 3030. [2019-11-27 23:11:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-27 23:11:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3856 transitions. [2019-11-27 23:11:50,925 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3856 transitions. Word has length 108 [2019-11-27 23:11:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:50,925 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3856 transitions. [2019-11-27 23:11:50,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:11:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3856 transitions. [2019-11-27 23:11:50,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-27 23:11:50,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:50,947 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:11:50,947 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:50,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1707496834, now seen corresponding path program 1 times [2019-11-27 23:11:50,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:50,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124015628] [2019-11-27 23:11:50,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:11:51,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124015628] [2019-11-27 23:11:51,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:11:51,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:11:51,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970718296] [2019-11-27 23:11:51,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:11:51,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:11:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:11:51,095 INFO L87 Difference]: Start difference. First operand 3030 states and 3856 transitions. Second operand 3 states. [2019-11-27 23:11:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:51,866 INFO L93 Difference]: Finished difference Result 6948 states and 8861 transitions. [2019-11-27 23:11:51,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:11:51,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-27 23:11:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:51,887 INFO L225 Difference]: With dead ends: 6948 [2019-11-27 23:11:51,887 INFO L226 Difference]: Without dead ends: 3920 [2019-11-27 23:11:51,893 INFO L630 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 [2019-11-27 23:11:51,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2019-11-27 23:11:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3030. [2019-11-27 23:11:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3030 states. [2019-11-27 23:11:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3835 transitions. [2019-11-27 23:11:51,961 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3835 transitions. Word has length 120 [2019-11-27 23:11:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:51,963 INFO L462 AbstractCegarLoop]: Abstraction has 3030 states and 3835 transitions. [2019-11-27 23:11:51,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:11:51,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3835 transitions. [2019-11-27 23:11:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-27 23:11:51,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:51,978 INFO L410 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-27 23:11:51,979 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:51,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1520336677, now seen corresponding path program 1 times [2019-11-27 23:11:51,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:51,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233474677] [2019-11-27 23:11:51,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 141 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-27 23:11:52,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233474677] [2019-11-27 23:11:52,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734579397] [2019-11-27 23:11:52,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:11:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:52,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:11:52,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:11:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-27 23:11:52,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:11:52,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-27 23:11:52,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667864219] [2019-11-27 23:11:52,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:11:52,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:52,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:11:52,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:11:52,557 INFO L87 Difference]: Start difference. First operand 3030 states and 3835 transitions. Second operand 3 states. [2019-11-27 23:11:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:53,282 INFO L93 Difference]: Finished difference Result 5880 states and 7484 transitions. [2019-11-27 23:11:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:11:53,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-11-27 23:11:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:53,295 INFO L225 Difference]: With dead ends: 5880 [2019-11-27 23:11:53,295 INFO L226 Difference]: Without dead ends: 2852 [2019-11-27 23:11:53,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:11:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2019-11-27 23:11:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 1962. [2019-11-27 23:11:53,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-27 23:11:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2498 transitions. [2019-11-27 23:11:53,340 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2498 transitions. Word has length 211 [2019-11-27 23:11:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:53,340 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2498 transitions. [2019-11-27 23:11:53,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:11:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2498 transitions. [2019-11-27 23:11:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-27 23:11:53,350 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:53,350 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:11:53,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:11:53,564 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 616710149, now seen corresponding path program 1 times [2019-11-27 23:11:53,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:53,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368373409] [2019-11-27 23:11:53,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 249 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-27 23:11:54,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368373409] [2019-11-27 23:11:54,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348332375] [2019-11-27 23:11:54,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:11:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:54,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:11:54,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:11:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-27 23:11:54,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:11:54,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-27 23:11:54,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690999493] [2019-11-27 23:11:54,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:11:54,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:54,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:11:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:11:54,330 INFO L87 Difference]: Start difference. First operand 1962 states and 2498 transitions. Second operand 3 states. [2019-11-27 23:11:55,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:55,220 INFO L93 Difference]: Finished difference Result 3566 states and 4614 transitions. [2019-11-27 23:11:55,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:11:55,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-11-27 23:11:55,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:55,231 INFO L225 Difference]: With dead ends: 3566 [2019-11-27 23:11:55,231 INFO L226 Difference]: Without dead ends: 1962 [2019-11-27 23:11:55,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:11:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-27 23:11:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-11-27 23:11:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-27 23:11:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2099 transitions. [2019-11-27 23:11:55,281 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2099 transitions. Word has length 351 [2019-11-27 23:11:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:55,282 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2099 transitions. [2019-11-27 23:11:55,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:11:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2099 transitions. [2019-11-27 23:11:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2019-11-27 23:11:55,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:55,296 INFO L410 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:11:55,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:11:55,509 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 107446009, now seen corresponding path program 1 times [2019-11-27 23:11:55,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:55,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441713669] [2019-11-27 23:11:55,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 410 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 23:11:56,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441713669] [2019-11-27 23:11:56,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320410083] [2019-11-27 23:11:56,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:11:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:11:56,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 23:11:56,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:11:56,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:11:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 391 proven. 23 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-27 23:11:56,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:11:56,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-27 23:11:56,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147934223] [2019-11-27 23:11:56,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:11:56,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:11:56,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:11:56,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:11:56,695 INFO L87 Difference]: Start difference. First operand 1784 states and 2099 transitions. Second operand 8 states. [2019-11-27 23:11:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:11:59,267 INFO L93 Difference]: Finished difference Result 3593 states and 4253 transitions. [2019-11-27 23:11:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:11:59,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 444 [2019-11-27 23:11:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:11:59,277 INFO L225 Difference]: With dead ends: 3593 [2019-11-27 23:11:59,277 INFO L226 Difference]: Without dead ends: 1989 [2019-11-27 23:11:59,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:11:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2019-11-27 23:11:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1784. [2019-11-27 23:11:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-27 23:11:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2087 transitions. [2019-11-27 23:11:59,311 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2087 transitions. Word has length 444 [2019-11-27 23:11:59,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:11:59,312 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2087 transitions. [2019-11-27 23:11:59,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:11:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2087 transitions. [2019-11-27 23:11:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-11-27 23:11:59,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:11:59,324 INFO L410 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:11:59,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:11:59,528 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:11:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:11:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -142907616, now seen corresponding path program 1 times [2019-11-27 23:11:59,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:11:59,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262101685] [2019-11-27 23:11:59,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:11:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:12:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 357 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-27 23:12:00,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262101685] [2019-11-27 23:12:00,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044624197] [2019-11-27 23:12:00,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:12:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:12:00,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:12:00,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:12:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-11-27 23:12:00,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:12:00,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-27 23:12:00,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673395828] [2019-11-27 23:12:00,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:12:00,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:12:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:12:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:12:00,760 INFO L87 Difference]: Start difference. First operand 1784 states and 2087 transitions. Second operand 4 states. [2019-11-27 23:12:02,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:12:02,129 INFO L93 Difference]: Finished difference Result 3595 states and 4201 transitions. [2019-11-27 23:12:02,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:12:02,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-11-27 23:12:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:12:02,138 INFO L225 Difference]: With dead ends: 3595 [2019-11-27 23:12:02,139 INFO L226 Difference]: Without dead ends: 1962 [2019-11-27 23:12:02,141 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:12:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-11-27 23:12:02,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2019-11-27 23:12:02,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-11-27 23:12:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 1913 transitions. [2019-11-27 23:12:02,171 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 1913 transitions. Word has length 526 [2019-11-27 23:12:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:12:02,172 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 1913 transitions. [2019-11-27 23:12:02,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:12:02,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 1913 transitions. [2019-11-27 23:12:02,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-11-27 23:12:02,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:12:02,191 INFO L410 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-27 23:12:02,396 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:12:02,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:12:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:12:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1409455003, now seen corresponding path program 1 times [2019-11-27 23:12:02,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:12:02,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455338364] [2019-11-27 23:12:02,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:12:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:12:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 926 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-11-27 23:12:03,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455338364] [2019-11-27 23:12:03,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:12:03,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 23:12:03,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138118471] [2019-11-27 23:12:03,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:12:03,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:12:03,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:12:03,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:12:03,816 INFO L87 Difference]: Start difference. First operand 1784 states and 1913 transitions. Second operand 8 states. [2019-11-27 23:12:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:12:05,511 INFO L93 Difference]: Finished difference Result 3572 states and 3839 transitions. [2019-11-27 23:12:05,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:12:05,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 662 [2019-11-27 23:12:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:12:05,520 INFO L225 Difference]: With dead ends: 3572 [2019-11-27 23:12:05,520 INFO L226 Difference]: Without dead ends: 1968 [2019-11-27 23:12:05,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:12:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2019-11-27 23:12:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1962. [2019-11-27 23:12:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2019-11-27 23:12:05,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2093 transitions. [2019-11-27 23:12:05,559 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2093 transitions. Word has length 662 [2019-11-27 23:12:05,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:12:05,561 INFO L462 AbstractCegarLoop]: Abstraction has 1962 states and 2093 transitions. [2019-11-27 23:12:05,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:12:05,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2093 transitions. [2019-11-27 23:12:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2019-11-27 23:12:05,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:12:05,570 INFO L410 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-27 23:12:05,571 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:12:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:12:05,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2096537786, now seen corresponding path program 1 times [2019-11-27 23:12:05,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:12:05,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267080365] [2019-11-27 23:12:05,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:12:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:12:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 775 proven. 182 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-27 23:12:06,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267080365] [2019-11-27 23:12:06,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379604900] [2019-11-27 23:12:06,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:12:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:12:06,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:12:06,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:12:06,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:12:06,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:12:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1304 backedges. 990 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-27 23:12:07,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:12:07,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-11-27 23:12:07,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969050987] [2019-11-27 23:12:07,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:12:07,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:12:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:12:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:12:07,595 INFO L87 Difference]: Start difference. First operand 1962 states and 2093 transitions. Second operand 5 states. [2019-11-27 23:12:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:12:09,370 INFO L93 Difference]: Finished difference Result 4810 states and 5190 transitions. [2019-11-27 23:12:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:12:09,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 688 [2019-11-27 23:12:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:12:09,373 INFO L225 Difference]: With dead ends: 4810 [2019-11-27 23:12:09,373 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:12:09,377 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 688 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:12:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:12:09,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:12:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:12:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:12:09,378 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 688 [2019-11-27 23:12:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:12:09,378 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:12:09,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:12:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:12:09,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:12:09,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:12:09,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:12:09,929 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-11-27 23:12:10,183 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2019-11-27 23:12:10,193 INFO L246 CegarLoopResult]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-27 23:12:10,194 INFO L246 CegarLoopResult]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-27 23:12:10,195 INFO L246 CegarLoopResult]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-27 23:12:10,196 INFO L246 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-27 23:12:10,197 INFO L246 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-27 23:12:10,199 INFO L246 CegarLoopResult]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-27 23:12:10,199 INFO L246 CegarLoopResult]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-27 23:12:10,199 INFO L246 CegarLoopResult]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-27 23:12:10,199 INFO L246 CegarLoopResult]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,199 INFO L246 CegarLoopResult]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,200 INFO L246 CegarLoopResult]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,200 INFO L246 CegarLoopResult]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-27 23:12:10,200 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-27 23:12:10,200 INFO L246 CegarLoopResult]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-27 23:12:10,200 INFO L246 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-27 23:12:10,201 INFO L246 CegarLoopResult]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-27 23:12:10,201 INFO L246 CegarLoopResult]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-27 23:12:10,201 INFO L246 CegarLoopResult]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-27 23:12:10,201 INFO L246 CegarLoopResult]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-27 23:12:10,201 INFO L246 CegarLoopResult]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-27 23:12:10,201 INFO L246 CegarLoopResult]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-27 23:12:10,202 INFO L246 CegarLoopResult]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-27 23:12:10,203 INFO L246 CegarLoopResult]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,204 INFO L246 CegarLoopResult]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,204 INFO L246 CegarLoopResult]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,204 INFO L246 CegarLoopResult]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-27 23:12:10,204 INFO L246 CegarLoopResult]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-27 23:12:10,204 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:12:10,205 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-27 23:12:10,205 INFO L246 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-27 23:12:10,205 INFO L246 CegarLoopResult]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-27 23:12:10,205 INFO L246 CegarLoopResult]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-27 23:12:10,205 INFO L246 CegarLoopResult]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-27 23:12:10,205 INFO L246 CegarLoopResult]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-27 23:12:10,206 INFO L246 CegarLoopResult]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,206 INFO L246 CegarLoopResult]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,206 INFO L246 CegarLoopResult]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,206 INFO L246 CegarLoopResult]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-27 23:12:10,206 INFO L246 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-27 23:12:10,207 INFO L246 CegarLoopResult]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-27 23:12:10,207 INFO L246 CegarLoopResult]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-27 23:12:10,207 INFO L246 CegarLoopResult]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-27 23:12:10,207 INFO L246 CegarLoopResult]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-27 23:12:10,207 INFO L246 CegarLoopResult]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-27 23:12:10,207 INFO L246 CegarLoopResult]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-27 23:12:10,208 INFO L246 CegarLoopResult]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,208 INFO L246 CegarLoopResult]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,208 INFO L246 CegarLoopResult]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,208 INFO L246 CegarLoopResult]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-27 23:12:10,208 INFO L246 CegarLoopResult]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-27 23:12:10,209 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-27 23:12:10,209 INFO L246 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-27 23:12:10,209 INFO L246 CegarLoopResult]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-27 23:12:10,209 INFO L246 CegarLoopResult]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-27 23:12:10,209 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:12:10,209 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 124) no Hoare annotation was computed. [2019-11-27 23:12:10,210 INFO L246 CegarLoopResult]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-27 23:12:10,210 INFO L246 CegarLoopResult]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-27 23:12:10,210 INFO L246 CegarLoopResult]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,210 INFO L246 CegarLoopResult]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,210 INFO L246 CegarLoopResult]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,210 INFO L246 CegarLoopResult]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-27 23:12:10,211 INFO L246 CegarLoopResult]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-27 23:12:10,211 INFO L246 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-27 23:12:10,211 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-27 23:12:10,211 INFO L246 CegarLoopResult]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-27 23:12:10,211 INFO L246 CegarLoopResult]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-27 23:12:10,211 INFO L246 CegarLoopResult]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-27 23:12:10,212 INFO L246 CegarLoopResult]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-27 23:12:10,212 INFO L246 CegarLoopResult]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,212 INFO L246 CegarLoopResult]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,212 INFO L246 CegarLoopResult]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,212 INFO L246 CegarLoopResult]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-27 23:12:10,213 INFO L246 CegarLoopResult]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-27 23:12:10,213 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-27 23:12:10,213 INFO L246 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-27 23:12:10,213 INFO L246 CegarLoopResult]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-27 23:12:10,213 INFO L246 CegarLoopResult]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-27 23:12:10,213 INFO L246 CegarLoopResult]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-27 23:12:10,214 INFO L246 CegarLoopResult]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-27 23:12:10,214 INFO L246 CegarLoopResult]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,214 INFO L246 CegarLoopResult]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,214 INFO L246 CegarLoopResult]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-27 23:12:10,214 INFO L246 CegarLoopResult]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-27 23:12:10,214 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-27 23:12:10,215 INFO L246 CegarLoopResult]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-27 23:12:10,215 INFO L246 CegarLoopResult]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-27 23:12:10,215 INFO L246 CegarLoopResult]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-27 23:12:10,215 INFO L246 CegarLoopResult]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-27 23:12:10,215 INFO L246 CegarLoopResult]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-27 23:12:10,215 INFO L246 CegarLoopResult]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,216 INFO L246 CegarLoopResult]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,216 INFO L246 CegarLoopResult]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-27 23:12:10,216 INFO L246 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-27 23:12:10,216 INFO L246 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-27 23:12:10,216 INFO L246 CegarLoopResult]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-27 23:12:10,217 INFO L246 CegarLoopResult]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-27 23:12:10,217 INFO L246 CegarLoopResult]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-27 23:12:10,217 INFO L246 CegarLoopResult]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,217 INFO L246 CegarLoopResult]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,218 INFO L242 CegarLoopResult]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 6))) (.cse0 (= ~a24~0 1)) (.cse2 (<= ~a12~0 11))) (or (and (exists ((v_~a12~0_435 Int)) (and (<= 0 (* 68 v_~a12~0_435)) (< 11 v_~a12~0_435) (<= (+ (* 5 (div (* v_~a12~0_435 68) 10)) 517842) ~a12~0) (<= 23 v_~a12~0_435))) .cse0) (<= ~a15~0 7) (and .cse1 .cse0 (<= 23 ~a12~0)) (and .cse0 (= ~a21~0 10) .cse2) (and .cse0 (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) (and (<= 9 ~a15~0) .cse0) (and .cse1 .cse0 .cse2 (< 0 (+ ~a12~0 43))))) [2019-11-27 23:12:10,218 INFO L246 CegarLoopResult]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-27 23:12:10,218 INFO L246 CegarLoopResult]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-27 23:12:10,218 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-27 23:12:10,218 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-27 23:12:10,218 INFO L246 CegarLoopResult]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-27 23:12:10,219 INFO L246 CegarLoopResult]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-27 23:12:10,219 INFO L246 CegarLoopResult]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-27 23:12:10,219 INFO L246 CegarLoopResult]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-27 23:12:10,219 INFO L246 CegarLoopResult]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,219 INFO L246 CegarLoopResult]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,219 INFO L249 CegarLoopResult]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-27 23:12:10,220 INFO L246 CegarLoopResult]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-27 23:12:10,220 INFO L246 CegarLoopResult]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-27 23:12:10,220 INFO L246 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-27 23:12:10,220 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-27 23:12:10,220 INFO L246 CegarLoopResult]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-27 23:12:10,220 INFO L246 CegarLoopResult]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-27 23:12:10,221 INFO L246 CegarLoopResult]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-27 23:12:10,221 INFO L246 CegarLoopResult]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,221 INFO L246 CegarLoopResult]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,221 INFO L246 CegarLoopResult]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-27 23:12:10,221 INFO L246 CegarLoopResult]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-27 23:12:10,222 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-27 23:12:10,222 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-27 23:12:10,222 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:12:10,222 INFO L246 CegarLoopResult]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-27 23:12:10,222 INFO L246 CegarLoopResult]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-27 23:12:10,222 INFO L246 CegarLoopResult]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,223 INFO L246 CegarLoopResult]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,223 INFO L246 CegarLoopResult]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-27 23:12:10,223 INFO L246 CegarLoopResult]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,223 INFO L246 CegarLoopResult]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-27 23:12:10,223 INFO L242 CegarLoopResult]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse1 (not (= ~a21~0 6))) (.cse0 (= ~a24~0 1)) (.cse2 (<= ~a12~0 11))) (or (and (exists ((v_~a12~0_435 Int)) (and (<= 0 (* 68 v_~a12~0_435)) (< 11 v_~a12~0_435) (<= (+ (* 5 (div (* v_~a12~0_435 68) 10)) 517842) ~a12~0) (<= 23 v_~a12~0_435))) .cse0) (<= ~a15~0 7) (and .cse1 .cse0 (<= 23 ~a12~0)) (and .cse0 (= ~a21~0 10) .cse2) (and .cse0 (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) (and (<= 9 ~a15~0) .cse0) (and .cse1 .cse0 .cse2 (< 0 (+ ~a12~0 43))))) [2019-11-27 23:12:10,224 INFO L246 CegarLoopResult]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-27 23:12:10,224 INFO L246 CegarLoopResult]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-27 23:12:10,224 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-27 23:12:10,224 INFO L246 CegarLoopResult]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-27 23:12:10,224 INFO L246 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-27 23:12:10,225 INFO L246 CegarLoopResult]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-27 23:12:10,225 INFO L246 CegarLoopResult]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-27 23:12:10,225 INFO L246 CegarLoopResult]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-27 23:12:10,225 INFO L246 CegarLoopResult]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-27 23:12:10,225 INFO L246 CegarLoopResult]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,225 INFO L246 CegarLoopResult]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,226 INFO L246 CegarLoopResult]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,226 INFO L246 CegarLoopResult]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-27 23:12:10,226 INFO L246 CegarLoopResult]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-27 23:12:10,226 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-27 23:12:10,226 INFO L246 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-27 23:12:10,227 INFO L246 CegarLoopResult]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-27 23:12:10,227 INFO L246 CegarLoopResult]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-27 23:12:10,227 INFO L246 CegarLoopResult]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-27 23:12:10,227 INFO L246 CegarLoopResult]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-27 23:12:10,227 INFO L246 CegarLoopResult]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-27 23:12:10,228 INFO L246 CegarLoopResult]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,228 INFO L246 CegarLoopResult]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,228 INFO L246 CegarLoopResult]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,228 INFO L246 CegarLoopResult]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-27 23:12:10,228 INFO L246 CegarLoopResult]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-27 23:12:10,228 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-27 23:12:10,229 INFO L246 CegarLoopResult]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-27 23:12:10,229 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:12:10,229 INFO L246 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-27 23:12:10,229 INFO L246 CegarLoopResult]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-27 23:12:10,229 INFO L246 CegarLoopResult]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-27 23:12:10,229 INFO L246 CegarLoopResult]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-27 23:12:10,230 INFO L246 CegarLoopResult]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,230 INFO L246 CegarLoopResult]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,230 INFO L246 CegarLoopResult]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,230 INFO L246 CegarLoopResult]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-27 23:12:10,230 INFO L246 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-27 23:12:10,230 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-27 23:12:10,231 INFO L246 CegarLoopResult]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-27 23:12:10,231 INFO L246 CegarLoopResult]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-27 23:12:10,231 INFO L246 CegarLoopResult]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-27 23:12:10,231 INFO L246 CegarLoopResult]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-27 23:12:10,231 INFO L246 CegarLoopResult]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-27 23:12:10,231 INFO L246 CegarLoopResult]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-27 23:12:10,232 INFO L246 CegarLoopResult]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-27 23:12:10,233 INFO L246 CegarLoopResult]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-27 23:12:10,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,254 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,255 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,257 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,258 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,259 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:12:10 BoogieIcfgContainer [2019-11-27 23:12:10,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:12:10,265 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:12:10,265 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:12:10,265 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:12:10,266 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:11:44" (3/4) ... [2019-11-27 23:12:10,270 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:12:10,297 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-27 23:12:10,299 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-27 23:12:10,330 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1) || a15 <= 7) || ((!(a21 == 6) && a24 == 1) && 23 <= a12)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((a24 == 1 && a21 == 7) && a12 + 49 <= 0)) || (9 <= a15 && a24 == 1)) || (((!(a21 == 6) && a24 == 1) && a12 <= 11) && 0 < a12 + 43) [2019-11-27 23:12:10,334 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1) || a15 <= 7) || ((!(a21 == 6) && a24 == 1) && 23 <= a12)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((a24 == 1 && a21 == 7) && a12 + 49 <= 0)) || (9 <= a15 && a24 == 1)) || (((!(a21 == 6) && a24 == 1) && a12 <= 11) && 0 < a12 + 43) [2019-11-27 23:12:10,477 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:12:10,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:12:10,480 INFO L168 Benchmark]: Toolchain (without parser) took 28827.77 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 989.9 MB). Free memory was 956.3 MB in the beginning and 930.1 MB in the end (delta: 26.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,480 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:12:10,480 INFO L168 Benchmark]: CACSL2BoogieTranslator took 839.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -110.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 197.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,481 INFO L168 Benchmark]: Boogie Preprocessor took 113.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,481 INFO L168 Benchmark]: RCFGBuilder took 1914.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 921.4 MB in the end (delta: 124.4 MB). Peak memory consumption was 124.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,482 INFO L168 Benchmark]: TraceAbstraction took 25541.97 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 888.1 MB). Free memory was 921.4 MB in the beginning and 954.2 MB in the end (delta: -32.8 MB). Peak memory consumption was 855.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,482 INFO L168 Benchmark]: Witness Printer took 212.17 ms. Allocated memory is still 2.0 GB. Free memory was 954.2 MB in the beginning and 930.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:12:10,484 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 839.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -110.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 197.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1914.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 921.4 MB in the end (delta: 124.4 MB). Peak memory consumption was 124.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25541.97 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 888.1 MB). Free memory was 921.4 MB in the beginning and 954.2 MB in the end (delta: -32.8 MB). Peak memory consumption was 855.3 MB. Max. memory is 11.5 GB. * Witness Printer took 212.17 ms. Allocated memory is still 2.0 GB. Free memory was 954.2 MB in the beginning and 930.1 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 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_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 124]: 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: 880]: Loop Invariant [2019-11-27 23:12:10,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,491 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,492 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1) || a15 <= 7) || ((!(a21 == 6) && a24 == 1) && 23 <= a12)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((a24 == 1 && a21 == 7) && a12 + 49 <= 0)) || (9 <= a15 && a24 == 1)) || (((!(a21 == 6) && a24 == 1) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 20]: Loop Invariant [2019-11-27 23:12:10,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] [2019-11-27 23:12:10,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_435,QUANTIFIED] Derived loop invariant: (((((((\exists v_~a12~0_435 : int :: ((0 <= 68 * v_~a12~0_435 && 11 < v_~a12~0_435) && 5 * (v_~a12~0_435 * 68 / 10) + 517842 <= a12) && 23 <= v_~a12~0_435) && a24 == 1) || a15 <= 7) || ((!(a21 == 6) && a24 == 1) && 23 <= a12)) || ((a24 == 1 && a21 == 10) && a12 <= 11)) || ((a24 == 1 && a21 == 7) && a12 + 49 <= 0)) || (9 <= a15 && a24 == 1)) || (((!(a21 == 6) && a24 == 1) && a12 <= 11) && 0 < a12 + 43) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 24.7s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1430 SDtfs, 2816 SDslu, 130 SDs, 0 SdLazy, 10021 SolverSat, 1329 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2268 GetRequests, 2221 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3030occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 2527 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 177 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5660 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 562 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 5476 NumberOfCodeBlocks, 5476 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5461 ConstructedInterpolants, 38 QuantifiedInterpolants, 11690439 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2787 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 7212/7433 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...