./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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/Problem10_label49.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 c2ee6781c62be40fa372129eaacaba9832af3ce9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 20:59:27,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 20:59:27,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 20:59:27,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 20:59:27,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 20:59:27,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 20:59:27,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 20:59:27,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 20:59:27,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 20:59:27,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 20:59:27,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 20:59:27,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 20:59:27,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 20:59:27,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 20:59:27,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 20:59:27,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 20:59:27,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 20:59:27,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 20:59:27,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 20:59:27,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 20:59:27,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 20:59:27,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 20:59:27,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 20:59:27,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 20:59:27,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 20:59:27,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 20:59:27,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 20:59:27,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 20:59:27,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 20:59:27,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 20:59:27,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 20:59:27,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 20:59:27,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 20:59:27,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 20:59:27,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 20:59:27,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 20:59:27,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 20:59:27,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 20:59:27,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 20:59:27,684 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 20:59:27,685 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 20:59:27,685 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 20:59:27,700 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 20:59:27,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 20:59:27,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 20:59:27,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 20:59:27,703 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 20:59:27,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 20:59:27,703 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 20:59:27,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 20:59:27,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 20:59:27,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 20:59:27,704 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 20:59:27,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 20:59:27,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 20:59:27,705 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 20:59:27,705 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 20:59:27,706 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 20:59:27,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 20:59:27,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 20:59:27,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 20:59:27,707 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 20:59:27,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 20:59:27,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:59:27,708 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 20:59:27,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 20:59:27,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 20:59:27,709 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 20:59:27,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 20:59:27,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 20:59:27,709 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 -> c2ee6781c62be40fa372129eaacaba9832af3ce9 [2019-11-19 20:59:28,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 20:59:28,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 20:59:28,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 20:59:28,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 20:59:28,047 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 20:59:28,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2019-11-19 20:59:28,126 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e2192cf/e82d718d21094351b1153dcabeb5a71d/FLAGec2333263 [2019-11-19 20:59:28,678 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 20:59:28,679 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label49.c [2019-11-19 20:59:28,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e2192cf/e82d718d21094351b1153dcabeb5a71d/FLAGec2333263 [2019-11-19 20:59:28,935 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e2192cf/e82d718d21094351b1153dcabeb5a71d [2019-11-19 20:59:28,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 20:59:28,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 20:59:28,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 20:59:28,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 20:59:28,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 20:59:28,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:59:28" (1/1) ... [2019-11-19 20:59:28,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604638ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:28, skipping insertion in model container [2019-11-19 20:59:28,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:59:28" (1/1) ... [2019-11-19 20:59:28,960 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 20:59:29,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 20:59:29,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:59:29,542 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 20:59:29,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 20:59:29,727 INFO L192 MainTranslator]: Completed translation [2019-11-19 20:59:29,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29 WrapperNode [2019-11-19 20:59:29,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 20:59:29,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 20:59:29,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 20:59:29,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 20:59:29,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 20:59:29,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 20:59:29,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 20:59:29,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 20:59:29,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... [2019-11-19 20:59:29,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 20:59:29,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 20:59:29,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 20:59:29,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 20:59:29,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 20:59:30,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 20:59:30,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 20:59:31,331 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 20:59:31,331 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 20:59:31,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:31 BoogieIcfgContainer [2019-11-19 20:59:31,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 20:59:31,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 20:59:31,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 20:59:31,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 20:59:31,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:59:28" (1/3) ... [2019-11-19 20:59:31,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d3eeb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:59:31, skipping insertion in model container [2019-11-19 20:59:31,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:59:29" (2/3) ... [2019-11-19 20:59:31,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d3eeb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:59:31, skipping insertion in model container [2019-11-19 20:59:31,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:31" (3/3) ... [2019-11-19 20:59:31,343 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label49.c [2019-11-19 20:59:31,355 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 20:59:31,365 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 20:59:31,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 20:59:31,423 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 20:59:31,424 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 20:59:31,424 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 20:59:31,424 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 20:59:31,424 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 20:59:31,425 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 20:59:31,426 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 20:59:31,426 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 20:59:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-11-19 20:59:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 20:59:31,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:31,469 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] [2019-11-19 20:59:31,470 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:31,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1644072970, now seen corresponding path program 1 times [2019-11-19 20:59:31,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:31,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529111903] [2019-11-19 20:59:31,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:31,714 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-19 20:59:31,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529111903] [2019-11-19 20:59:31,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:31,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:59:31,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890622876] [2019-11-19 20:59:31,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:31,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:31,745 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-11-19 20:59:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:33,541 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-11-19 20:59:33,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:33,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-19 20:59:33,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:33,561 INFO L225 Difference]: With dead ends: 694 [2019-11-19 20:59:33,562 INFO L226 Difference]: Without dead ends: 421 [2019-11-19 20:59:33,567 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-19 20:59:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-11-19 20:59:33,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2019-11-19 20:59:33,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-11-19 20:59:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 586 transitions. [2019-11-19 20:59:33,646 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 586 transitions. Word has length 22 [2019-11-19 20:59:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:33,647 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 586 transitions. [2019-11-19 20:59:33,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 586 transitions. [2019-11-19 20:59:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 20:59:33,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:33,652 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:33,652 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:33,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1869682614, now seen corresponding path program 1 times [2019-11-19 20:59:33,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:33,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042979780] [2019-11-19 20:59:33,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:34,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042979780] [2019-11-19 20:59:34,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468133335] [2019-11-19 20:59:34,114 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-19 20:59:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:34,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:59:34,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-19 20:59:34,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:59:34,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-11-19 20:59:34,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849495481] [2019-11-19 20:59:34,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:59:34,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:34,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:59:34,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:59:34,256 INFO L87 Difference]: Start difference. First operand 421 states and 586 transitions. Second operand 3 states. [2019-11-19 20:59:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:34,867 INFO L93 Difference]: Finished difference Result 840 states and 1170 transitions. [2019-11-19 20:59:34,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:59:34,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-19 20:59:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:34,873 INFO L225 Difference]: With dead ends: 840 [2019-11-19 20:59:34,874 INFO L226 Difference]: Without dead ends: 838 [2019-11-19 20:59:34,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:59:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-19 20:59:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 560. [2019-11-19 20:59:34,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2019-11-19 20:59:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 800 transitions. [2019-11-19 20:59:34,906 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 800 transitions. Word has length 88 [2019-11-19 20:59:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:34,907 INFO L462 AbstractCegarLoop]: Abstraction has 560 states and 800 transitions. [2019-11-19 20:59:34,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:59:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 800 transitions. [2019-11-19 20:59:34,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-19 20:59:34,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:34,911 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:35,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:35,116 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:35,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1943772973, now seen corresponding path program 1 times [2019-11-19 20:59:35,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:35,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736463558] [2019-11-19 20:59:35,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:35,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736463558] [2019-11-19 20:59:35,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:35,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 20:59:35,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590346053] [2019-11-19 20:59:35,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:35,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:35,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:35,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:35,207 INFO L87 Difference]: Start difference. First operand 560 states and 800 transitions. Second operand 4 states. [2019-11-19 20:59:36,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:36,144 INFO L93 Difference]: Finished difference Result 1674 states and 2334 transitions. [2019-11-19 20:59:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:36,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-19 20:59:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:36,152 INFO L225 Difference]: With dead ends: 1674 [2019-11-19 20:59:36,153 INFO L226 Difference]: Without dead ends: 1116 [2019-11-19 20:59:36,155 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-19 20:59:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-11-19 20:59:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-11-19 20:59:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-19 20:59:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1083 transitions. [2019-11-19 20:59:36,185 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1083 transitions. Word has length 91 [2019-11-19 20:59:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:36,185 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1083 transitions. [2019-11-19 20:59:36,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:36,186 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1083 transitions. [2019-11-19 20:59:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-11-19 20:59:36,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:36,194 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:59:36,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:36,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1933258404, now seen corresponding path program 1 times [2019-11-19 20:59:36,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:36,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781031564] [2019-11-19 20:59:36,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:36,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781031564] [2019-11-19 20:59:36,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:36,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:59:36,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152869046] [2019-11-19 20:59:36,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:36,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:36,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:36,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:36,414 INFO L87 Difference]: Start difference. First operand 838 states and 1083 transitions. Second operand 4 states. [2019-11-19 20:59:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:37,437 INFO L93 Difference]: Finished difference Result 1813 states and 2348 transitions. [2019-11-19 20:59:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:37,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-11-19 20:59:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:37,444 INFO L225 Difference]: With dead ends: 1813 [2019-11-19 20:59:37,444 INFO L226 Difference]: Without dead ends: 977 [2019-11-19 20:59:37,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-19 20:59:37,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-19 20:59:37,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-11-19 20:59:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-11-19 20:59:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1177 transitions. [2019-11-19 20:59:37,467 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1177 transitions. Word has length 182 [2019-11-19 20:59:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:37,467 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 1177 transitions. [2019-11-19 20:59:37,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1177 transitions. [2019-11-19 20:59:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-19 20:59:37,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:37,472 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 20:59:37,472 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:37,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:37,472 INFO L82 PathProgramCache]: Analyzing trace with hash -51833937, now seen corresponding path program 1 times [2019-11-19 20:59:37,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:37,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782034234] [2019-11-19 20:59:37,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 20:59:37,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782034234] [2019-11-19 20:59:37,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:37,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:59:37,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700618908] [2019-11-19 20:59:37,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:59:37,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:59:37,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:37,654 INFO L87 Difference]: Start difference. First operand 977 states and 1177 transitions. Second operand 5 states. [2019-11-19 20:59:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:39,164 INFO L93 Difference]: Finished difference Result 3620 states and 4392 transitions. [2019-11-19 20:59:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:59:39,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-11-19 20:59:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:39,179 INFO L225 Difference]: With dead ends: 3620 [2019-11-19 20:59:39,180 INFO L226 Difference]: Without dead ends: 2645 [2019-11-19 20:59:39,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2019-11-19 20:59:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 1672. [2019-11-19 20:59:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-19 20:59:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1977 transitions. [2019-11-19 20:59:39,235 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1977 transitions. Word has length 189 [2019-11-19 20:59:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:39,235 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1977 transitions. [2019-11-19 20:59:39,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:59:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1977 transitions. [2019-11-19 20:59:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-19 20:59:39,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:39,241 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:59:39,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:39,242 INFO L82 PathProgramCache]: Analyzing trace with hash 298360043, now seen corresponding path program 1 times [2019-11-19 20:59:39,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:39,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925411093] [2019-11-19 20:59:39,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:39,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925411093] [2019-11-19 20:59:39,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:39,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 20:59:39,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633699207] [2019-11-19 20:59:39,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 20:59:39,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 20:59:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:39,470 INFO L87 Difference]: Start difference. First operand 1672 states and 1977 transitions. Second operand 5 states. [2019-11-19 20:59:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:40,741 INFO L93 Difference]: Finished difference Result 4593 states and 5384 transitions. [2019-11-19 20:59:40,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 20:59:40,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-11-19 20:59:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:40,753 INFO L225 Difference]: With dead ends: 4593 [2019-11-19 20:59:40,754 INFO L226 Difference]: Without dead ends: 1811 [2019-11-19 20:59:40,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 20:59:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2019-11-19 20:59:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1533. [2019-11-19 20:59:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2019-11-19 20:59:40,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1717 transitions. [2019-11-19 20:59:40,804 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1717 transitions. Word has length 229 [2019-11-19 20:59:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:40,804 INFO L462 AbstractCegarLoop]: Abstraction has 1533 states and 1717 transitions. [2019-11-19 20:59:40,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 20:59:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1717 transitions. [2019-11-19 20:59:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-19 20:59:40,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:40,811 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-19 20:59:40,812 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1307309551, now seen corresponding path program 1 times [2019-11-19 20:59:40,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:40,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339782652] [2019-11-19 20:59:40,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 142 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:41,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339782652] [2019-11-19 20:59:41,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285653944] [2019-11-19 20:59:41,367 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-19 20:59:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:41,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:59:41,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:41,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-19 20:59:41,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:59:41,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-19 20:59:41,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347096665] [2019-11-19 20:59:41,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:59:41,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:41,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:59:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:59:41,546 INFO L87 Difference]: Start difference. First operand 1533 states and 1717 transitions. Second operand 3 states. [2019-11-19 20:59:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:42,128 INFO L93 Difference]: Finished difference Result 3481 states and 3910 transitions. [2019-11-19 20:59:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:59:42,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-19 20:59:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:42,139 INFO L225 Difference]: With dead ends: 3481 [2019-11-19 20:59:42,140 INFO L226 Difference]: Without dead ends: 1950 [2019-11-19 20:59:42,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 20:59:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-11-19 20:59:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-11-19 20:59:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-19 20:59:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1865 transitions. [2019-11-19 20:59:42,177 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1865 transitions. Word has length 265 [2019-11-19 20:59:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:42,178 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 1865 transitions. [2019-11-19 20:59:42,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:59:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1865 transitions. [2019-11-19 20:59:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-19 20:59:42,183 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:42,183 INFO L410 BasicCegarLoop]: trace histogram [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, 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-19 20:59:42,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:42,394 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:42,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:42,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1440717452, now seen corresponding path program 1 times [2019-11-19 20:59:42,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:42,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168705794] [2019-11-19 20:59:42,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 256 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168705794] [2019-11-19 20:59:42,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154977130] [2019-11-19 20:59:42,661 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-19 20:59:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:42,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 20:59:42,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:42,899 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:42,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:59:42,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-19 20:59:42,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053637707] [2019-11-19 20:59:42,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:42,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:59:42,902 INFO L87 Difference]: Start difference. First operand 1672 states and 1865 transitions. Second operand 4 states. [2019-11-19 20:59:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:44,016 INFO L93 Difference]: Finished difference Result 4037 states and 4530 transitions. [2019-11-19 20:59:44,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:44,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-11-19 20:59:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:44,028 INFO L225 Difference]: With dead ends: 4037 [2019-11-19 20:59:44,028 INFO L226 Difference]: Without dead ends: 2367 [2019-11-19 20:59:44,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 20:59:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-11-19 20:59:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2228. [2019-11-19 20:59:44,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2019-11-19 20:59:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2423 transitions. [2019-11-19 20:59:44,075 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2423 transitions. Word has length 270 [2019-11-19 20:59:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:44,076 INFO L462 AbstractCegarLoop]: Abstraction has 2228 states and 2423 transitions. [2019-11-19 20:59:44,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:44,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2423 transitions. [2019-11-19 20:59:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-19 20:59:44,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:44,083 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:59:44,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:44,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash -876938456, now seen corresponding path program 1 times [2019-11-19 20:59:44,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:44,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248318569] [2019-11-19 20:59:44,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 230 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 20:59:44,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248318569] [2019-11-19 20:59:44,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900591344] [2019-11-19 20:59:44,611 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-19 20:59:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:44,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 20:59:44,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 20:59:44,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:44,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 20:59:45,339 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 21 [2019-11-19 20:59:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2019-11-19 20:59:45,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 20:59:45,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-19 20:59:45,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37740574] [2019-11-19 20:59:45,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 20:59:45,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:45,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 20:59:45,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 20:59:45,455 INFO L87 Difference]: Start difference. First operand 2228 states and 2423 transitions. Second operand 3 states. [2019-11-19 20:59:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:48,563 INFO L93 Difference]: Finished difference Result 5010 states and 5469 transitions. [2019-11-19 20:59:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 20:59:48,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-19 20:59:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:48,574 INFO L225 Difference]: With dead ends: 5010 [2019-11-19 20:59:48,574 INFO L226 Difference]: Without dead ends: 2784 [2019-11-19 20:59:48,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-19 20:59:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2019-11-19 20:59:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2506. [2019-11-19 20:59:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-11-19 20:59:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2717 transitions. [2019-11-19 20:59:48,624 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2717 transitions. Word has length 283 [2019-11-19 20:59:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:48,625 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 2717 transitions. [2019-11-19 20:59:48,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 20:59:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2717 transitions. [2019-11-19 20:59:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-19 20:59:48,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 20:59:48,633 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-19 20:59:48,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 20:59:48,842 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 20:59:48,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 20:59:48,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1778174755, now seen corresponding path program 1 times [2019-11-19 20:59:48,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 20:59:48,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738047205] [2019-11-19 20:59:48,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 20:59:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 20:59:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-19 20:59:49,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738047205] [2019-11-19 20:59:49,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 20:59:49,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 20:59:49,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422623164] [2019-11-19 20:59:49,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 20:59:49,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 20:59:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 20:59:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 20:59:49,022 INFO L87 Difference]: Start difference. First operand 2506 states and 2717 transitions. Second operand 4 states. [2019-11-19 20:59:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 20:59:49,611 INFO L93 Difference]: Finished difference Result 2506 states and 2717 transitions. [2019-11-19 20:59:49,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 20:59:49,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-19 20:59:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 20:59:49,613 INFO L225 Difference]: With dead ends: 2506 [2019-11-19 20:59:49,613 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 20:59:49,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-19 20:59:49,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 20:59:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 20:59:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 20:59:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 20:59:49,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 319 [2019-11-19 20:59:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 20:59:49,618 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 20:59:49,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 20:59:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 20:59:49,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 20:59:49,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 20:59:50,397 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2019-11-19 20:59:50,998 WARN L191 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 66 [2019-11-19 20:59:51,001 INFO L444 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,002 INFO L444 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-11-19 20:59:51,003 INFO L444 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-11-19 20:59:51,003 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-19 20:59:51,003 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-19 20:59:51,003 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-19 20:59:51,003 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-19 20:59:51,004 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-19 20:59:51,004 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-11-19 20:59:51,005 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-11-19 20:59:51,006 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-11-19 20:59:51,007 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-11-19 20:59:51,008 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,008 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,008 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,008 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,008 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,008 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-11-19 20:59:51,009 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 20:59:51,009 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-19 20:59:51,009 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-19 20:59:51,009 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-19 20:59:51,009 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L440 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse5 (= ~a10~0 2))) (let ((.cse10 (not .cse5)) (.cse9 (not (= 10 ~a19~0))) (.cse4 (<= ~a19~0 8))) (let ((.cse0 (< 218 ~a1~0)) (.cse1 (and .cse5 .cse4)) (.cse7 (exists ((v_~a1~0_342 Int)) (let ((.cse12 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse12) (= 0 (mod (+ .cse12 1) 25)) (<= ~a1~0 (+ (mod .cse12 25) 12)) (<= 0 (* 9 v_~a1~0_342)))))) (.cse6 (= 9 ~a19~0)) (.cse8 (= ~a10~0 0)) (.cse3 (and .cse10 .cse9)) (.cse2 (not (= ~a10~0 3))) (.cse11 (<= 1 ~a10~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6) (and .cse1 .cse7) (= ~a19~0 7) (and .cse8 .cse9) (and (and (<= ~a1~0 218) .cse3 (< 0 (+ ~a1~0 13))) .cse4) (and .cse7 .cse5 .cse6) (and .cse7 (or (and .cse2 .cse10 (<= (+ ~a1~0 437977) 0) (not .cse6)) .cse8)) (and .cse3 .cse11 (not (= ~a19~0 8))) (and .cse2 .cse10 .cse11))))) [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,016 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-19 20:59:51,017 INFO L444 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L447 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,018 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,019 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-11-19 20:59:51,020 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-19 20:59:51,021 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L440 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse5 (= ~a10~0 2))) (let ((.cse10 (not .cse5)) (.cse9 (not (= 10 ~a19~0))) (.cse4 (<= ~a19~0 8))) (let ((.cse0 (< 218 ~a1~0)) (.cse1 (and .cse5 .cse4)) (.cse7 (exists ((v_~a1~0_342 Int)) (let ((.cse12 (div (* v_~a1~0_342 9) 10))) (and (<= 0 .cse12) (= 0 (mod (+ .cse12 1) 25)) (<= ~a1~0 (+ (mod .cse12 25) 12)) (<= 0 (* 9 v_~a1~0_342)))))) (.cse6 (= 9 ~a19~0)) (.cse8 (= ~a10~0 0)) (.cse3 (and .cse10 .cse9)) (.cse2 (not (= ~a10~0 3))) (.cse11 (<= 1 ~a10~0))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6) (and .cse1 .cse7) (= ~a19~0 7) (and .cse8 .cse9) (and (and (<= ~a1~0 218) .cse3 (< 0 (+ ~a1~0 13))) .cse4) (and .cse7 .cse5 .cse6) (and .cse7 (or (and .cse2 .cse10 (<= (+ ~a1~0 437977) 0) (not .cse6)) .cse8)) (and .cse3 .cse11 (not (= ~a19~0 8))) (and .cse2 .cse10 .cse11))))) [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,022 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,023 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,023 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-19 20:59:51,023 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,023 INFO L444 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-11-19 20:59:51,025 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-11-19 20:59:51,026 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-11-19 20:59:51,026 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-11-19 20:59:51,026 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,026 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,026 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,026 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 20:59:51,027 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,028 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,029 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,029 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,029 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,029 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,029 INFO L444 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-11-19 20:59:51,029 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-19 20:59:51,030 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 20:59:51,030 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-19 20:59:51,030 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-19 20:59:51,030 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-19 20:59:51,030 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 20:59:51,030 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-19 20:59:51,031 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-11-19 20:59:51,031 INFO L444 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-11-19 20:59:51,031 INFO L444 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-11-19 20:59:51,031 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-11-19 20:59:51,031 INFO L444 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-11-19 20:59:51,031 INFO L444 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-11-19 20:59:51,032 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,032 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,032 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,032 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,032 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,033 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,033 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-11-19 20:59:51,033 INFO L444 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-11-19 20:59:51,033 INFO L444 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-11-19 20:59:51,033 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-19 20:59:51,033 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-11-19 20:59:51,034 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 20:59:51,035 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-11-19 20:59:51,035 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-11-19 20:59:51,035 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,035 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,035 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,036 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,036 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,036 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-11-19 20:59:51,036 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-11-19 20:59:51,036 INFO L444 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-11-19 20:59:51,036 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-11-19 20:59:51,037 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-19 20:59:51,037 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-19 20:59:51,037 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-19 20:59:51,037 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-19 20:59:51,037 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 20:59:51,037 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-19 20:59:51,038 INFO L444 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-11-19 20:59:51,038 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-11-19 20:59:51,038 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-11-19 20:59:51,047 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,048 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,049 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,050 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,051 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,052 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,061 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,074 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:59:51 BoogieIcfgContainer [2019-11-19 20:59:51,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 20:59:51,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 20:59:51,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 20:59:51,080 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 20:59:51,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:59:31" (3/4) ... [2019-11-19 20:59:51,085 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 20:59:51,107 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 20:59:51,108 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 20:59:51,141 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((218 < a1 && a10 == 2 && a19 <= 8) || ((!(a10 == 3) && !(a10 == 2) && !(10 == a19)) && a19 <= 8)) || ((218 < a1 && a10 == 2) && 9 == a19)) || ((a10 == 2 && a19 <= 8) && (\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342))) || a19 == 7) || (a10 == 0 && !(10 == a19))) || (((a1 <= 218 && !(a10 == 2) && !(10 == a19)) && 0 < a1 + 13) && a19 <= 8)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && 9 == a19)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(9 == a19)) || a10 == 0))) || (((!(a10 == 2) && !(10 == a19)) && 1 <= a10) && !(a19 == 8))) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10) [2019-11-19 20:59:51,145 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((218 < a1 && a10 == 2 && a19 <= 8) || ((!(a10 == 3) && !(a10 == 2) && !(10 == a19)) && a19 <= 8)) || ((218 < a1 && a10 == 2) && 9 == a19)) || ((a10 == 2 && a19 <= 8) && (\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342))) || a19 == 7) || (a10 == 0 && !(10 == a19))) || (((a1 <= 218 && !(a10 == 2) && !(10 == a19)) && 0 < a1 + 13) && a19 <= 8)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && 9 == a19)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(9 == a19)) || a10 == 0))) || (((!(a10 == 2) && !(10 == a19)) && 1 <= a10) && !(a19 == 8))) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10) [2019-11-19 20:59:51,275 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 20:59:51,276 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 20:59:51,277 INFO L168 Benchmark]: Toolchain (without parser) took 22337.00 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 546.3 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -81.3 MB). Peak memory consumption was 465.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,278 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 20:59:51,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.02 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,279 INFO L168 Benchmark]: Boogie Preprocessor took 122.87 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,279 INFO L168 Benchmark]: RCFGBuilder took 1380.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.1 MB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,280 INFO L168 Benchmark]: TraceAbstraction took 19744.89 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 426.8 MB). Free memory was 973.1 MB in the beginning and 1.1 GB in the end (delta: -84.8 MB). Peak memory consumption was 342.0 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,280 INFO L168 Benchmark]: Witness Printer took 196.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-11-19 20:59:51,282 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 787.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.02 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 122.87 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: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1380.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 973.1 MB in the end (delta: 106.8 MB). Peak memory consumption was 106.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19744.89 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 426.8 MB). Free memory was 973.1 MB in the beginning and 1.1 GB in the end (delta: -84.8 MB). Peak memory consumption was 342.0 MB. Max. memory is 11.5 GB. * Witness Printer took 196.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 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_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant [2019-11-19 20:59:51,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,304 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] Derived loop invariant: ((((((((((218 < a1 && a10 == 2 && a19 <= 8) || ((!(a10 == 3) && !(a10 == 2) && !(10 == a19)) && a19 <= 8)) || ((218 < a1 && a10 == 2) && 9 == a19)) || ((a10 == 2 && a19 <= 8) && (\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342))) || a19 == 7) || (a10 == 0 && !(10 == a19))) || (((a1 <= 218 && !(a10 == 2) && !(10 == a19)) && 0 < a1 + 13) && a19 <= 8)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && 9 == a19)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(9 == a19)) || a10 == 0))) || (((!(a10 == 2) && !(10 == a19)) && 1 <= a10) && !(a19 == 8))) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10) - InvariantResult [Line: 20]: Loop Invariant [2019-11-19 20:59:51,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,309 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] [2019-11-19 20:59:51,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a1~0_342,QUANTIFIED] Derived loop invariant: ((((((((((218 < a1 && a10 == 2 && a19 <= 8) || ((!(a10 == 3) && !(a10 == 2) && !(10 == a19)) && a19 <= 8)) || ((218 < a1 && a10 == 2) && 9 == a19)) || ((a10 == 2 && a19 <= 8) && (\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342))) || a19 == 7) || (a10 == 0 && !(10 == a19))) || (((a1 <= 218 && !(a10 == 2) && !(10 == a19)) && 0 < a1 + 13) && a19 <= 8)) || (((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && a10 == 2) && 9 == a19)) || ((\exists v_~a1~0_342 : int :: ((0 <= v_~a1~0_342 * 9 / 10 && 0 == (v_~a1~0_342 * 9 / 10 + 1) % 25) && a1 <= v_~a1~0_342 * 9 / 10 % 25 + 12) && 0 <= 9 * v_~a1~0_342) && ((((!(a10 == 3) && !(a10 == 2)) && a1 + 437977 <= 0) && !(9 == a19)) || a10 == 0))) || (((!(a10 == 2) && !(10 == a19)) && 1 <= a10) && !(a19 == 8))) || ((!(a10 == 3) && !(a10 == 2)) && 1 <= a10) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Result: SAFE, OverallTime: 19.6s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, HoareTripleCheckerStatistics: 883 SDtfs, 2350 SDslu, 100 SDs, 0 SdLazy, 6897 SolverSat, 979 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 914 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2506occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 2502 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 64 NumberOfFragments, 495 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2350 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2502 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2844 NumberOfCodeBlocks, 2844 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2830 ConstructedInterpolants, 20 QuantifiedInterpolants, 2541186 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1292 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 1994/2056 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...