/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label01.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:50:35,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:50:35,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:50:35,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:50:35,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:50:35,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:50:35,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:50:35,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:50:35,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:50:35,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:50:35,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:50:35,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:50:35,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:50:35,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:50:35,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:50:35,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:50:35,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:50:35,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:50:35,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:50:35,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:50:35,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:50:35,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:50:35,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:50:35,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:50:35,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:50:35,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:50:35,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:50:35,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:50:35,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:50:35,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:50:35,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:50:35,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:50:35,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:50:35,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:50:35,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:50:35,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:50:35,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:50:35,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:50:35,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:50:35,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:50:35,360 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:50:35,361 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-23 20:50:35,387 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:50:35,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:50:35,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:50:35,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:50:35,390 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:50:35,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:50:35,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:50:35,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:50:35,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:50:35,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:50:35,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:50:35,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:50:35,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:50:35,392 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:50:35,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:50:35,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:50:35,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:50:35,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:50:35,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:50:35,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:50:35,394 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:50:35,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:50:35,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:50:35,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:50:35,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:50:35,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:50:35,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:50:35,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:50:35,397 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:50:35,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:50:35,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:50:35,674 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:50:35,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:50:35,679 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:50:35,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:50:35,680 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label01.c [2019-11-23 20:50:35,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f9d294c/df123d61e12545f986df00d22d65c3f7/FLAG465e30ad8 [2019-11-23 20:50:36,314 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:50:36,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label01.c [2019-11-23 20:50:36,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f9d294c/df123d61e12545f986df00d22d65c3f7/FLAG465e30ad8 [2019-11-23 20:50:36,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02f9d294c/df123d61e12545f986df00d22d65c3f7 [2019-11-23 20:50:36,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:50:36,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:50:36,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:50:36,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:50:36,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:50:36,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:36" (1/1) ... [2019-11-23 20:50:36,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f7d9541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:36, skipping insertion in model container [2019-11-23 20:50:36,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:50:36" (1/1) ... [2019-11-23 20:50:36,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:50:36,644 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:50:37,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:50:37,167 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:50:37,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:50:37,339 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:50:37,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37 WrapperNode [2019-11-23 20:50:37,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:50:37,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:50:37,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:50:37,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:50:37,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:50:37,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:50:37,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:50:37,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:50:37,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (1/1) ... [2019-11-23 20:50:37,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:50:37,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:50:37,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:50:37,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:50:37,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (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-23 20:50:37,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:50:37,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:50:38,745 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:50:38,746 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:50:38,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:38 BoogieIcfgContainer [2019-11-23 20:50:38,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:50:38,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:50:38,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:50:38,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:50:38,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:50:36" (1/3) ... [2019-11-23 20:50:38,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223621f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:38, skipping insertion in model container [2019-11-23 20:50:38,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:50:37" (2/3) ... [2019-11-23 20:50:38,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@223621f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:50:38, skipping insertion in model container [2019-11-23 20:50:38,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:50:38" (3/3) ... [2019-11-23 20:50:38,757 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label01.c [2019-11-23 20:50:38,770 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:50:38,780 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:50:38,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:50:38,833 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:50:38,834 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:50:38,834 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:50:38,834 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:50:38,834 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:50:38,835 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:50:38,835 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:50:38,835 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:50:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:50:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-23 20:50:38,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:38,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:50:38,877 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1687716446, now seen corresponding path program 1 times [2019-11-23 20:50:38,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:38,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553605882] [2019-11-23 20:50:38,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:39,330 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-23 20:50:39,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553605882] [2019-11-23 20:50:39,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:39,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:39,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754743499] [2019-11-23 20:50:39,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:39,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:39,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:39,356 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-23 20:50:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:40,739 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-23 20:50:40,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:50:40,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-23 20:50:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:40,760 INFO L225 Difference]: With dead ends: 662 [2019-11-23 20:50:40,760 INFO L226 Difference]: Without dead ends: 397 [2019-11-23 20:50:40,765 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-23 20:50:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-23 20:50:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-11-23 20:50:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-11-23 20:50:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 559 transitions. [2019-11-23 20:50:40,848 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 559 transitions. Word has length 91 [2019-11-23 20:50:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 559 transitions. [2019-11-23 20:50:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 559 transitions. [2019-11-23 20:50:40,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-23 20:50:40,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:40,859 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:40,860 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1583336838, now seen corresponding path program 1 times [2019-11-23 20:50:40,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:40,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657729848] [2019-11-23 20:50:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:50:40,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657729848] [2019-11-23 20:50:40,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:40,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:50:40,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362473657] [2019-11-23 20:50:40,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:40,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:40,980 INFO L87 Difference]: Start difference. First operand 397 states and 559 transitions. Second operand 4 states. [2019-11-23 20:50:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:41,618 INFO L93 Difference]: Finished difference Result 1185 states and 1672 transitions. [2019-11-23 20:50:41,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:41,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-23 20:50:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:41,623 INFO L225 Difference]: With dead ends: 1185 [2019-11-23 20:50:41,623 INFO L226 Difference]: Without dead ends: 790 [2019-11-23 20:50:41,626 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-23 20:50:41,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-23 20:50:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-23 20:50:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-23 20:50:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1066 transitions. [2019-11-23 20:50:41,671 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1066 transitions. Word has length 96 [2019-11-23 20:50:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:41,671 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1066 transitions. [2019-11-23 20:50:41,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1066 transitions. [2019-11-23 20:50:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-23 20:50:41,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:41,678 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:50:41,678 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1473567844, now seen corresponding path program 1 times [2019-11-23 20:50:41,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:41,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972015102] [2019-11-23 20:50:41,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:50:41,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972015102] [2019-11-23 20:50:41,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:41,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:50:41,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204183577] [2019-11-23 20:50:41,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:41,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:41,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:41,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:41,813 INFO L87 Difference]: Start difference. First operand 790 states and 1066 transitions. Second operand 3 states. [2019-11-23 20:50:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:42,358 INFO L93 Difference]: Finished difference Result 1971 states and 2686 transitions. [2019-11-23 20:50:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:42,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-23 20:50:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:42,368 INFO L225 Difference]: With dead ends: 1971 [2019-11-23 20:50:42,368 INFO L226 Difference]: Without dead ends: 1183 [2019-11-23 20:50:42,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:42,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-23 20:50:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 921. [2019-11-23 20:50:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-23 20:50:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-11-23 20:50:42,427 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 117 [2019-11-23 20:50:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:42,429 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-11-23 20:50:42,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-11-23 20:50:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-23 20:50:42,444 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:42,444 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:42,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:42,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1222693529, now seen corresponding path program 1 times [2019-11-23 20:50:42,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:42,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907504508] [2019-11-23 20:50:42,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-23 20:50:42,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907504508] [2019-11-23 20:50:42,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:42,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:50:42,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689011337] [2019-11-23 20:50:42,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:42,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:42,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:42,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:42,558 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 3 states. [2019-11-23 20:50:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:43,131 INFO L93 Difference]: Finished difference Result 2233 states and 2997 transitions. [2019-11-23 20:50:43,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:43,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-23 20:50:43,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:43,137 INFO L225 Difference]: With dead ends: 2233 [2019-11-23 20:50:43,137 INFO L226 Difference]: Without dead ends: 1314 [2019-11-23 20:50:43,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2019-11-23 20:50:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2019-11-23 20:50:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-11-23 20:50:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1508 transitions. [2019-11-23 20:50:43,165 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1508 transitions. Word has length 153 [2019-11-23 20:50:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:43,165 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1508 transitions. [2019-11-23 20:50:43,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1508 transitions. [2019-11-23 20:50:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-23 20:50:43,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:43,169 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:43,169 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash 160905897, now seen corresponding path program 1 times [2019-11-23 20:50:43,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:43,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55601500] [2019-11-23 20:50:43,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-23 20:50:43,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55601500] [2019-11-23 20:50:43,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:43,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:50:43,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363317062] [2019-11-23 20:50:43,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:43,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:43,239 INFO L87 Difference]: Start difference. First operand 1183 states and 1508 transitions. Second operand 3 states. [2019-11-23 20:50:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:43,731 INFO L93 Difference]: Finished difference Result 3150 states and 4004 transitions. [2019-11-23 20:50:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:43,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-11-23 20:50:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:43,741 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:50:43,741 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:50:43,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:50:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-23 20:50:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-23 20:50:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2134 transitions. [2019-11-23 20:50:43,804 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2134 transitions. Word has length 172 [2019-11-23 20:50:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:43,804 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2134 transitions. [2019-11-23 20:50:43,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2134 transitions. [2019-11-23 20:50:43,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-11-23 20:50:43,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:43,809 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:43,809 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash -645359518, now seen corresponding path program 1 times [2019-11-23 20:50:43,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:43,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292343480] [2019-11-23 20:50:43,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:50:43,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292343480] [2019-11-23 20:50:43,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:43,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:50:43,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773690684] [2019-11-23 20:50:43,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:43,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:43,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:43,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:43,877 INFO L87 Difference]: Start difference. First operand 1707 states and 2134 transitions. Second operand 3 states. [2019-11-23 20:50:44,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:44,352 INFO L93 Difference]: Finished difference Result 3674 states and 4582 transitions. [2019-11-23 20:50:44,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:44,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-11-23 20:50:44,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:44,361 INFO L225 Difference]: With dead ends: 3674 [2019-11-23 20:50:44,361 INFO L226 Difference]: Without dead ends: 1969 [2019-11-23 20:50:44,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:50:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-23 20:50:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-11-23 20:50:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:50:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2408 transitions. [2019-11-23 20:50:44,405 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2408 transitions. Word has length 175 [2019-11-23 20:50:44,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:44,405 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2408 transitions. [2019-11-23 20:50:44,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2408 transitions. [2019-11-23 20:50:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-23 20:50:44,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:44,410 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:44,411 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:44,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1056675030, now seen corresponding path program 1 times [2019-11-23 20:50:44,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:44,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575362035] [2019-11-23 20:50:44,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-23 20:50:44,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575362035] [2019-11-23 20:50:44,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:44,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 20:50:44,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261463114] [2019-11-23 20:50:44,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 20:50:44,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:44,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 20:50:44,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:50:44,716 INFO L87 Difference]: Start difference. First operand 1969 states and 2408 transitions. Second operand 8 states. [2019-11-23 20:50:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:45,811 INFO L93 Difference]: Finished difference Result 4106 states and 4990 transitions. [2019-11-23 20:50:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-23 20:50:45,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 179 [2019-11-23 20:50:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:45,820 INFO L225 Difference]: With dead ends: 4106 [2019-11-23 20:50:45,820 INFO L226 Difference]: Without dead ends: 2139 [2019-11-23 20:50:45,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-23 20:50:45,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-11-23 20:50:45,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1969. [2019-11-23 20:50:45,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:50:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2396 transitions. [2019-11-23 20:50:45,860 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2396 transitions. Word has length 179 [2019-11-23 20:50:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:45,860 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2396 transitions. [2019-11-23 20:50:45,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 20:50:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2396 transitions. [2019-11-23 20:50:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 20:50:45,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:45,887 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:45,887 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:45,888 INFO L82 PathProgramCache]: Analyzing trace with hash 916250074, now seen corresponding path program 1 times [2019-11-23 20:50:45,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:45,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446356726] [2019-11-23 20:50:45,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-23 20:50:46,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446356726] [2019-11-23 20:50:46,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:46,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:50:46,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979193665] [2019-11-23 20:50:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:46,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:46,033 INFO L87 Difference]: Start difference. First operand 1969 states and 2396 transitions. Second operand 4 states. [2019-11-23 20:50:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:46,871 INFO L93 Difference]: Finished difference Result 4198 states and 5112 transitions. [2019-11-23 20:50:46,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:50:46,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-11-23 20:50:46,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:46,880 INFO L225 Difference]: With dead ends: 4198 [2019-11-23 20:50:46,880 INFO L226 Difference]: Without dead ends: 2231 [2019-11-23 20:50:46,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-11-23 20:50:46,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2019-11-23 20:50:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-23 20:50:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2461 transitions. [2019-11-23 20:50:46,925 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2461 transitions. Word has length 212 [2019-11-23 20:50:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:46,927 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2461 transitions. [2019-11-23 20:50:46,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2461 transitions. [2019-11-23 20:50:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-23 20:50:46,934 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:46,934 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-11-23 20:50:46,935 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1317230938, now seen corresponding path program 1 times [2019-11-23 20:50:46,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:46,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919945095] [2019-11-23 20:50:46,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:47,130 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-23 20:50:47,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919945095] [2019-11-23 20:50:47,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:47,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:50:47,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966640954] [2019-11-23 20:50:47,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:50:47,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:50:47,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:47,138 INFO L87 Difference]: Start difference. First operand 2100 states and 2461 transitions. Second operand 4 states. [2019-11-23 20:50:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:47,796 INFO L93 Difference]: Finished difference Result 4722 states and 5498 transitions. [2019-11-23 20:50:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:50:47,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-11-23 20:50:47,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:47,805 INFO L225 Difference]: With dead ends: 4722 [2019-11-23 20:50:47,805 INFO L226 Difference]: Without dead ends: 2624 [2019-11-23 20:50:47,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:50:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-11-23 20:50:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 1969. [2019-11-23 20:50:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-23 20:50:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2311 transitions. [2019-11-23 20:50:47,842 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2311 transitions. Word has length 238 [2019-11-23 20:50:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:47,842 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2311 transitions. [2019-11-23 20:50:47,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:50:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2311 transitions. [2019-11-23 20:50:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-23 20:50:47,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:47,848 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:47,848 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:47,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash 503715675, now seen corresponding path program 1 times [2019-11-23 20:50:47,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:47,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256366420] [2019-11-23 20:50:47,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-23 20:50:48,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256366420] [2019-11-23 20:50:48,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:50:48,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 20:50:48,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651465711] [2019-11-23 20:50:48,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 20:50:48,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:48,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 20:50:48,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:50:48,047 INFO L87 Difference]: Start difference. First operand 1969 states and 2311 transitions. Second operand 6 states. [2019-11-23 20:50:48,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:48,871 INFO L93 Difference]: Finished difference Result 4105 states and 4795 transitions. [2019-11-23 20:50:48,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:50:48,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-11-23 20:50:48,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:48,885 INFO L225 Difference]: With dead ends: 4105 [2019-11-23 20:50:48,885 INFO L226 Difference]: Without dead ends: 2138 [2019-11-23 20:50:48,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:50:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-23 20:50:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-23 20:50:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-23 20:50:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-23 20:50:48,934 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 259 [2019-11-23 20:50:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:48,934 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-23 20:50:48,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 20:50:48,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-23 20:50:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-11-23 20:50:48,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:50:48,946 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:50:48,946 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:50:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:50:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 221877156, now seen corresponding path program 1 times [2019-11-23 20:50:48,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:50:48,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500018661] [2019-11-23 20:50:48,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:50:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:50:50,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500018661] [2019-11-23 20:50:50,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463619400] [2019-11-23 20:50:50,614 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-23 20:50:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:50:50,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:50:50,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:50:50,950 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-23 20:50:50,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:50:50,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-23 20:50:50,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128177576] [2019-11-23 20:50:50,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:50:50,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:50:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:50:50,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:50:50,955 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-23 20:50:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:50:51,431 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-23 20:50:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:50:51,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-11-23 20:50:51,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:50:51,432 INFO L225 Difference]: With dead ends: 3672 [2019-11-23 20:50:51,432 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:50:51,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:50:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:50:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:50:51,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:50:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:50:51,435 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-11-23 20:50:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:50:51,436 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:50:51,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:50:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:50:51,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:50:51,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:50:51,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:50:51,761 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 86 [2019-11-23 20:50:52,271 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-11-23 20:50:52,780 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 38 [2019-11-23 20:50:52,783 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:50:52,783 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:50:52,784 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:50:52,785 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:50:52,785 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:50:52,785 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:50:52,785 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:50:52,785 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,786 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,787 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,787 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,787 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:50:52,787 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:50:52,788 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:50:52,789 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:50:52,789 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:50:52,791 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:50:52,792 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:50:52,792 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:50:52,792 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,793 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:50:52,794 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:50:52,795 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:50:52,795 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:50:52,795 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse3 (= ~a20~0 1)) (.cse4 (= 15 ~a8~0)) (.cse5 (not .cse8)) (.cse0 (not (= 1 ~a7~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse2 (= ~a16~0 5)) (and (or (and .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3)) .cse1) (and .cse6 .cse7 (<= ~a17~0 0)) (and .cse0 .cse2 .cse4 .cse8) (and .cse6 .cse8) (and .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse2 (not .cse1)) (and .cse6 .cse1)))) [2019-11-23 20:50:52,795 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,795 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,796 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,797 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,797 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,797 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:50:52,797 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:50:52,798 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:50:52,799 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:50:52,799 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:50:52,799 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:50:52,799 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,799 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,799 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:50:52,800 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:50:52,801 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:50:52,801 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:50:52,801 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,801 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,801 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:50:52,802 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:50:52,803 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,804 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse8 (= ~a16~0 6))) (let ((.cse3 (= ~a20~0 1)) (.cse4 (= 15 ~a8~0)) (.cse5 (not .cse8)) (.cse0 (not (= 1 ~a7~0))) (.cse7 (= ~a16~0 4)) (.cse2 (= ~a21~0 1)) (.cse6 (<= ~a21~0 0)) (.cse1 (= ~a17~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse2 (= ~a16~0 5)) (and (or (and .cse2 .cse3 .cse4) (and .cse5 .cse2 .cse3)) .cse1) (and .cse6 .cse7 (<= ~a17~0 0)) (and .cse0 .cse2 .cse4 .cse8) (and .cse6 .cse8) (and .cse5 .cse0 .cse1 .cse2) (and .cse7 .cse2 (not .cse1)) (and .cse6 .cse1)))) [2019-11-23 20:50:52,804 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,804 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,804 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,804 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,804 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:50:52,804 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:50:52,805 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:50:52,805 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:50:52,805 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:50:52,805 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:50:52,805 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:50:52,806 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:50:52,807 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:50:52,808 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:50:52,809 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,810 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:50:52,811 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:50:52,812 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 449) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,813 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:50:52,814 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:50:52,815 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:50:52,815 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:50:52,815 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:50:52,815 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:50:52,815 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:50:52,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:50:52 BoogieIcfgContainer [2019-11-23 20:50:52,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:50:52,861 INFO L168 Benchmark]: Toolchain (without parser) took 16284.70 ms. Allocated memory was 137.9 MB in the beginning and 509.6 MB in the end (delta: 371.7 MB). Free memory was 99.9 MB in the beginning and 450.2 MB in the end (delta: -350.3 MB). Peak memory consumption was 389.4 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,862 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.57 ms. Allocated memory was 137.9 MB in the beginning and 203.9 MB in the end (delta: 66.1 MB). Free memory was 99.5 MB in the beginning and 169.4 MB in the end (delta: -69.9 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.87 ms. Allocated memory is still 203.9 MB. Free memory was 169.4 MB in the beginning and 163.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,865 INFO L168 Benchmark]: Boogie Preprocessor took 88.66 ms. Allocated memory is still 203.9 MB. Free memory was 163.8 MB in the beginning and 158.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,865 INFO L168 Benchmark]: RCFGBuilder took 1195.32 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 158.8 MB in the beginning and 172.1 MB in the end (delta: -13.2 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,866 INFO L168 Benchmark]: TraceAbstraction took 14110.53 ms. Allocated memory was 235.9 MB in the beginning and 509.6 MB in the end (delta: 273.7 MB). Free memory was 172.1 MB in the beginning and 450.2 MB in the end (delta: -278.2 MB). Peak memory consumption was 363.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:50:52,870 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.22 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.57 ms. Allocated memory was 137.9 MB in the beginning and 203.9 MB in the end (delta: 66.1 MB). Free memory was 99.5 MB in the beginning and 169.4 MB in the end (delta: -69.9 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 122.87 ms. Allocated memory is still 203.9 MB. Free memory was 169.4 MB in the beginning and 163.8 MB in the end (delta: 5.6 MB). Peak memory consumption was 5.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 88.66 ms. Allocated memory is still 203.9 MB. Free memory was 163.8 MB in the beginning and 158.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1195.32 ms. Allocated memory was 203.9 MB in the beginning and 235.9 MB in the end (delta: 32.0 MB). Free memory was 158.8 MB in the beginning and 172.1 MB in the end (delta: -13.2 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14110.53 ms. Allocated memory was 235.9 MB in the beginning and 509.6 MB in the end (delta: 273.7 MB). Free memory was 172.1 MB in the beginning and 450.2 MB in the end (delta: -278.2 MB). Peak memory consumption was 363.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 449]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || (a21 == 1 && a16 == 5)) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (a21 <= 0 && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a21 <= 0 && a17 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((!(1 == a7) && a17 == 1) && a21 == 1) && a20 == 1) || (a21 == 1 && a16 == 5)) || ((((a21 == 1 && a20 == 1) && 15 == a8) || ((!(a16 == 6) && a21 == 1) && a20 == 1)) && a17 == 1)) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (((!(1 == a7) && a21 == 1) && 15 == a8) && a16 == 6)) || (a21 <= 0 && a16 == 6)) || (((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a21 == 1) && !(a17 == 1))) || (a21 <= 0 && a17 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.9s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 951 SDtfs, 2137 SDslu, 120 SDs, 0 SdLazy, 5988 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 338 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1911 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 225 HoareAnnotationTreeSize, 3 FomulaSimplifications, 6228 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4081 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2254 NumberOfCodeBlocks, 2254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1623912 SizeOfPredicates, 1 NumberOfNonLiveVariables, 513 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 2711/2719 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...