/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/Problem03_label16.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:55:17,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:55:17,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:55:17,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:55:17,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:55:17,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:55:17,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:55:17,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:55:17,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:55:17,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:55:17,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:55:17,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:55:17,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:55:17,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:55:17,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:55:17,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:55:17,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:55:17,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:55:17,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:55:17,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:55:17,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:55:17,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:55:17,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:55:17,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:55:17,443 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:55:17,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:55:17,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:55:17,445 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:55:17,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:55:17,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:55:17,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:55:17,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:55:17,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:55:17,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:55:17,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:55:17,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:55:17,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:55:17,454 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:55:17,454 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:55:17,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:55:17,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:55:17,457 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:55:17,483 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:55:17,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:55:17,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:55:17,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:55:17,485 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:55:17,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:55:17,485 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:55:17,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:55:17,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:55:17,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:55:17,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:55:17,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:55:17,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:55:17,486 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:55:17,487 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:55:17,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:55:17,487 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:55:17,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:55:17,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:55:17,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:55:17,488 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:55:17,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:55:17,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:55:17,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:55:17,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:55:17,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:55:17,489 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:55:17,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:55:17,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:55:17,490 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:55:17,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:55:17,822 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:55:17,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:55:17,828 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:55:17,829 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:55:17,830 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label16.c [2019-11-23 20:55:17,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af97d97c/9a43458d890a45668e779afdfd6cbe1d/FLAG3a1349fc2 [2019-11-23 20:55:18,475 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:55:18,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label16.c [2019-11-23 20:55:18,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af97d97c/9a43458d890a45668e779afdfd6cbe1d/FLAG3a1349fc2 [2019-11-23 20:55:18,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af97d97c/9a43458d890a45668e779afdfd6cbe1d [2019-11-23 20:55:18,761 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:55:18,762 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:55:18,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:18,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:55:18,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:55:18,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:18" (1/1) ... [2019-11-23 20:55:18,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4822bd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:18, skipping insertion in model container [2019-11-23 20:55:18,771 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:55:18" (1/1) ... [2019-11-23 20:55:18,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:55:18,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:55:19,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:19,604 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:55:19,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:55:19,884 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:55:19,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19 WrapperNode [2019-11-23 20:55:19,885 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:55:19,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:19,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:55:19,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:55:19,911 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:55:19" (1/1) ... [2019-11-23 20:55:19,990 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:55:19" (1/1) ... [2019-11-23 20:55:20,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:55:20,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:55:20,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:55:20,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:55:20,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (1/1) ... [2019-11-23 20:55:20,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:55:20,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:55:20,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:55:20,191 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:55:20,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (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:55:20,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:55:20,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:55:22,211 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:55:22,211 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:55:22,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:22 BoogieIcfgContainer [2019-11-23 20:55:22,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:55:22,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:55:22,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:55:22,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:55:22,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:55:18" (1/3) ... [2019-11-23 20:55:22,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680a5a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:22, skipping insertion in model container [2019-11-23 20:55:22,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:19" (2/3) ... [2019-11-23 20:55:22,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680a5a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:22, skipping insertion in model container [2019-11-23 20:55:22,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:22" (3/3) ... [2019-11-23 20:55:22,222 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label16.c [2019-11-23 20:55:22,232 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:55:22,240 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:55:22,254 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:55:22,292 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:55:22,292 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:55:22,292 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:55:22,293 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:55:22,293 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:55:22,293 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:55:22,293 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:55:22,293 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:55:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-23 20:55:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 20:55:22,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:22,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:22,339 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash 812227147, now seen corresponding path program 1 times [2019-11-23 20:55:22,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:22,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357537679] [2019-11-23 20:55:22,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:23,084 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:55:23,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357537679] [2019-11-23 20:55:23,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:23,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:23,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289754166] [2019-11-23 20:55:23,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:23,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:23,113 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-11-23 20:55:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:25,297 INFO L93 Difference]: Finished difference Result 1071 states and 1917 transitions. [2019-11-23 20:55:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:25,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-23 20:55:25,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:25,321 INFO L225 Difference]: With dead ends: 1071 [2019-11-23 20:55:25,321 INFO L226 Difference]: Without dead ends: 673 [2019-11-23 20:55:25,328 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:55:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-11-23 20:55:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 458. [2019-11-23 20:55:25,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-11-23 20:55:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 702 transitions. [2019-11-23 20:55:25,433 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 702 transitions. Word has length 165 [2019-11-23 20:55:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:25,435 INFO L462 AbstractCegarLoop]: Abstraction has 458 states and 702 transitions. [2019-11-23 20:55:25,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 702 transitions. [2019-11-23 20:55:25,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-23 20:55:25,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:25,450 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:25,450 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:25,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1291791372, now seen corresponding path program 1 times [2019-11-23 20:55:25,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:25,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119941501] [2019-11-23 20:55:25,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:25,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119941501] [2019-11-23 20:55:25,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:25,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:25,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609970965] [2019-11-23 20:55:25,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:25,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:25,617 INFO L87 Difference]: Start difference. First operand 458 states and 702 transitions. Second operand 3 states. [2019-11-23 20:55:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:26,786 INFO L93 Difference]: Finished difference Result 1339 states and 2070 transitions. [2019-11-23 20:55:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:26,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-11-23 20:55:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:26,792 INFO L225 Difference]: With dead ends: 1339 [2019-11-23 20:55:26,793 INFO L226 Difference]: Without dead ends: 883 [2019-11-23 20:55:26,795 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:55:26,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-11-23 20:55:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 867. [2019-11-23 20:55:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-11-23 20:55:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1310 transitions. [2019-11-23 20:55:26,830 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1310 transitions. Word has length 173 [2019-11-23 20:55:26,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:26,830 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1310 transitions. [2019-11-23 20:55:26,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:26,831 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1310 transitions. [2019-11-23 20:55:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-23 20:55:26,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:26,834 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash -479908031, now seen corresponding path program 1 times [2019-11-23 20:55:26,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:26,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629759782] [2019-11-23 20:55:26,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:27,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629759782] [2019-11-23 20:55:27,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:27,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:27,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696039823] [2019-11-23 20:55:27,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:27,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:27,042 INFO L87 Difference]: Start difference. First operand 867 states and 1310 transitions. Second operand 3 states. [2019-11-23 20:55:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:28,165 INFO L93 Difference]: Finished difference Result 2561 states and 3889 transitions. [2019-11-23 20:55:28,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:28,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-11-23 20:55:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:28,181 INFO L225 Difference]: With dead ends: 2561 [2019-11-23 20:55:28,181 INFO L226 Difference]: Without dead ends: 1696 [2019-11-23 20:55:28,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-11-23 20:55:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1680. [2019-11-23 20:55:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1680 states. [2019-11-23 20:55:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2480 transitions. [2019-11-23 20:55:28,239 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2480 transitions. Word has length 180 [2019-11-23 20:55:28,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:28,242 INFO L462 AbstractCegarLoop]: Abstraction has 1680 states and 2480 transitions. [2019-11-23 20:55:28,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2480 transitions. [2019-11-23 20:55:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-23 20:55:28,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:28,260 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:28,260 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:28,260 INFO L82 PathProgramCache]: Analyzing trace with hash -533103651, now seen corresponding path program 1 times [2019-11-23 20:55:28,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:28,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520114670] [2019-11-23 20:55:28,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:28,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520114670] [2019-11-23 20:55:28,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:28,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:28,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495452205] [2019-11-23 20:55:28,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:28,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:28,368 INFO L87 Difference]: Start difference. First operand 1680 states and 2480 transitions. Second operand 3 states. [2019-11-23 20:55:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:29,483 INFO L93 Difference]: Finished difference Result 4988 states and 7374 transitions. [2019-11-23 20:55:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:29,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-11-23 20:55:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:29,504 INFO L225 Difference]: With dead ends: 4988 [2019-11-23 20:55:29,504 INFO L226 Difference]: Without dead ends: 3310 [2019-11-23 20:55:29,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:29,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-11-23 20:55:29,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3309. [2019-11-23 20:55:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3309 states. [2019-11-23 20:55:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3309 states to 3309 states and 4574 transitions. [2019-11-23 20:55:29,607 INFO L78 Accepts]: Start accepts. Automaton has 3309 states and 4574 transitions. Word has length 186 [2019-11-23 20:55:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:29,607 INFO L462 AbstractCegarLoop]: Abstraction has 3309 states and 4574 transitions. [2019-11-23 20:55:29,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3309 states and 4574 transitions. [2019-11-23 20:55:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-23 20:55:29,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:29,617 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:29,618 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash -171068847, now seen corresponding path program 1 times [2019-11-23 20:55:29,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:29,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220449893] [2019-11-23 20:55:29,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-23 20:55:29,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220449893] [2019-11-23 20:55:29,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:29,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:29,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441283293] [2019-11-23 20:55:29,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:29,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:29,734 INFO L87 Difference]: Start difference. First operand 3309 states and 4574 transitions. Second operand 3 states. [2019-11-23 20:55:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:30,879 INFO L93 Difference]: Finished difference Result 9664 states and 13365 transitions. [2019-11-23 20:55:30,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:30,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-23 20:55:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:30,911 INFO L225 Difference]: With dead ends: 9664 [2019-11-23 20:55:30,912 INFO L226 Difference]: Without dead ends: 6357 [2019-11-23 20:55:30,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:30,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6357 states. [2019-11-23 20:55:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6357 to 6354. [2019-11-23 20:55:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-11-23 20:55:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 8029 transitions. [2019-11-23 20:55:31,057 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 8029 transitions. Word has length 192 [2019-11-23 20:55:31,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:31,057 INFO L462 AbstractCegarLoop]: Abstraction has 6354 states and 8029 transitions. [2019-11-23 20:55:31,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 8029 transitions. [2019-11-23 20:55:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-23 20:55:31,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:31,069 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:31,070 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:31,070 INFO L82 PathProgramCache]: Analyzing trace with hash -265000342, now seen corresponding path program 1 times [2019-11-23 20:55:31,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:31,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953971594] [2019-11-23 20:55:31,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:31,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953971594] [2019-11-23 20:55:31,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:31,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:31,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933629041] [2019-11-23 20:55:31,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:31,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:31,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:31,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:31,171 INFO L87 Difference]: Start difference. First operand 6354 states and 8029 transitions. Second operand 4 states. [2019-11-23 20:55:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:32,444 INFO L93 Difference]: Finished difference Result 12707 states and 16058 transitions. [2019-11-23 20:55:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:32,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-23 20:55:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:32,474 INFO L225 Difference]: With dead ends: 12707 [2019-11-23 20:55:32,475 INFO L226 Difference]: Without dead ends: 6355 [2019-11-23 20:55:32,483 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:55:32,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-11-23 20:55:32,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 6354. [2019-11-23 20:55:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6354 states. [2019-11-23 20:55:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6354 states to 6354 states and 7704 transitions. [2019-11-23 20:55:32,613 INFO L78 Accepts]: Start accepts. Automaton has 6354 states and 7704 transitions. Word has length 195 [2019-11-23 20:55:32,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:32,613 INFO L462 AbstractCegarLoop]: Abstraction has 6354 states and 7704 transitions. [2019-11-23 20:55:32,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6354 states and 7704 transitions. [2019-11-23 20:55:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-11-23 20:55:32,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:32,631 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:32,631 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1132202157, now seen corresponding path program 1 times [2019-11-23 20:55:32,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:32,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141835479] [2019-11-23 20:55:32,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-23 20:55:32,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141835479] [2019-11-23 20:55:32,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:32,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:32,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318647467] [2019-11-23 20:55:32,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:32,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:32,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:32,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:32,802 INFO L87 Difference]: Start difference. First operand 6354 states and 7704 transitions. Second operand 3 states. [2019-11-23 20:55:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:33,395 INFO L93 Difference]: Finished difference Result 12471 states and 15142 transitions. [2019-11-23 20:55:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:33,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-11-23 20:55:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:33,418 INFO L225 Difference]: With dead ends: 12471 [2019-11-23 20:55:33,418 INFO L226 Difference]: Without dead ends: 6119 [2019-11-23 20:55:33,425 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:55:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2019-11-23 20:55:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 6119. [2019-11-23 20:55:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6119 states. [2019-11-23 20:55:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 7274 transitions. [2019-11-23 20:55:33,536 INFO L78 Accepts]: Start accepts. Automaton has 6119 states and 7274 transitions. Word has length 212 [2019-11-23 20:55:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:33,536 INFO L462 AbstractCegarLoop]: Abstraction has 6119 states and 7274 transitions. [2019-11-23 20:55:33,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 6119 states and 7274 transitions. [2019-11-23 20:55:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-23 20:55:33,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:33,550 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,550 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:33,551 INFO L82 PathProgramCache]: Analyzing trace with hash -881817172, now seen corresponding path program 1 times [2019-11-23 20:55:33,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:33,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205489958] [2019-11-23 20:55:33,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:33,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205489958] [2019-11-23 20:55:33,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:33,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:33,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194001455] [2019-11-23 20:55:33,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:33,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:33,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:33,669 INFO L87 Difference]: Start difference. First operand 6119 states and 7274 transitions. Second operand 3 states. [2019-11-23 20:55:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:34,672 INFO L93 Difference]: Finished difference Result 14672 states and 17661 transitions. [2019-11-23 20:55:34,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:34,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-23 20:55:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:34,705 INFO L225 Difference]: With dead ends: 14672 [2019-11-23 20:55:34,705 INFO L226 Difference]: Without dead ends: 8555 [2019-11-23 20:55:34,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8555 states. [2019-11-23 20:55:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8555 to 8555. [2019-11-23 20:55:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8555 states. [2019-11-23 20:55:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8555 states to 8555 states and 9796 transitions. [2019-11-23 20:55:34,820 INFO L78 Accepts]: Start accepts. Automaton has 8555 states and 9796 transitions. Word has length 218 [2019-11-23 20:55:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:34,820 INFO L462 AbstractCegarLoop]: Abstraction has 8555 states and 9796 transitions. [2019-11-23 20:55:34,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 8555 states and 9796 transitions. [2019-11-23 20:55:34,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-23 20:55:34,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:34,835 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:34,836 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:34,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash -485960375, now seen corresponding path program 1 times [2019-11-23 20:55:34,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:34,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529295336] [2019-11-23 20:55:34,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 20:55:34,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529295336] [2019-11-23 20:55:34,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:34,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:34,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340137717] [2019-11-23 20:55:34,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:34,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:34,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:34,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:34,948 INFO L87 Difference]: Start difference. First operand 8555 states and 9796 transitions. Second operand 3 states. [2019-11-23 20:55:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:36,032 INFO L93 Difference]: Finished difference Result 22190 states and 25472 transitions. [2019-11-23 20:55:36,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:36,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-23 20:55:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:36,077 INFO L225 Difference]: With dead ends: 22190 [2019-11-23 20:55:36,077 INFO L226 Difference]: Without dead ends: 13637 [2019-11-23 20:55:36,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13637 states. [2019-11-23 20:55:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13637 to 13633. [2019-11-23 20:55:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13633 states. [2019-11-23 20:55:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13633 states to 13633 states and 15459 transitions. [2019-11-23 20:55:36,361 INFO L78 Accepts]: Start accepts. Automaton has 13633 states and 15459 transitions. Word has length 244 [2019-11-23 20:55:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:36,362 INFO L462 AbstractCegarLoop]: Abstraction has 13633 states and 15459 transitions. [2019-11-23 20:55:36,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 13633 states and 15459 transitions. [2019-11-23 20:55:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-11-23 20:55:36,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:36,391 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:36,391 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:36,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:36,391 INFO L82 PathProgramCache]: Analyzing trace with hash 839673078, now seen corresponding path program 1 times [2019-11-23 20:55:36,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:36,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383692115] [2019-11-23 20:55:36,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-23 20:55:36,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383692115] [2019-11-23 20:55:36,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:36,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:36,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391677330] [2019-11-23 20:55:36,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:36,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:36,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:36,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:36,587 INFO L87 Difference]: Start difference. First operand 13633 states and 15459 transitions. Second operand 4 states. [2019-11-23 20:55:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:37,644 INFO L93 Difference]: Finished difference Result 27272 states and 30930 transitions. [2019-11-23 20:55:37,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:37,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 252 [2019-11-23 20:55:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:37,664 INFO L225 Difference]: With dead ends: 27272 [2019-11-23 20:55:37,665 INFO L226 Difference]: Without dead ends: 13641 [2019-11-23 20:55:37,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13641 states. [2019-11-23 20:55:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13641 to 13633. [2019-11-23 20:55:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13633 states. [2019-11-23 20:55:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13633 states to 13633 states and 15417 transitions. [2019-11-23 20:55:37,972 INFO L78 Accepts]: Start accepts. Automaton has 13633 states and 15417 transitions. Word has length 252 [2019-11-23 20:55:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:37,973 INFO L462 AbstractCegarLoop]: Abstraction has 13633 states and 15417 transitions. [2019-11-23 20:55:37,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13633 states and 15417 transitions. [2019-11-23 20:55:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-11-23 20:55:37,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:37,996 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:37,996 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:37,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:37,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1320161854, now seen corresponding path program 1 times [2019-11-23 20:55:37,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:37,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335242548] [2019-11-23 20:55:37,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-23 20:55:38,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335242548] [2019-11-23 20:55:38,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:38,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:55:38,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627281263] [2019-11-23 20:55:38,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:55:38,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:38,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:55:38,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:38,238 INFO L87 Difference]: Start difference. First operand 13633 states and 15417 transitions. Second operand 5 states. [2019-11-23 20:55:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:40,110 INFO L93 Difference]: Finished difference Result 39458 states and 44446 transitions. [2019-11-23 20:55:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:55:40,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2019-11-23 20:55:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:40,137 INFO L225 Difference]: With dead ends: 39458 [2019-11-23 20:55:40,137 INFO L226 Difference]: Without dead ends: 25827 [2019-11-23 20:55:40,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:55:40,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25827 states. [2019-11-23 20:55:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25827 to 25822. [2019-11-23 20:55:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25822 states. [2019-11-23 20:55:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25822 states to 25822 states and 28988 transitions. [2019-11-23 20:55:40,493 INFO L78 Accepts]: Start accepts. Automaton has 25822 states and 28988 transitions. Word has length 264 [2019-11-23 20:55:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:40,493 INFO L462 AbstractCegarLoop]: Abstraction has 25822 states and 28988 transitions. [2019-11-23 20:55:40,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:55:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25822 states and 28988 transitions. [2019-11-23 20:55:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-23 20:55:40,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:40,517 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:40,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:40,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:40,518 INFO L82 PathProgramCache]: Analyzing trace with hash 599450342, now seen corresponding path program 1 times [2019-11-23 20:55:40,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:40,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524866175] [2019-11-23 20:55:40,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:40,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524866175] [2019-11-23 20:55:40,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:40,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:40,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261675995] [2019-11-23 20:55:40,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:40,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:40,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:40,709 INFO L87 Difference]: Start difference. First operand 25822 states and 28988 transitions. Second operand 4 states. [2019-11-23 20:55:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:42,505 INFO L93 Difference]: Finished difference Result 53893 states and 60614 transitions. [2019-11-23 20:55:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:42,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 273 [2019-11-23 20:55:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:42,529 INFO L225 Difference]: With dead ends: 53893 [2019-11-23 20:55:42,529 INFO L226 Difference]: Without dead ends: 28073 [2019-11-23 20:55:42,544 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:55:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28073 states. [2019-11-23 20:55:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28073 to 27452. [2019-11-23 20:55:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27452 states. [2019-11-23 20:55:42,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27452 states to 27452 states and 30859 transitions. [2019-11-23 20:55:42,875 INFO L78 Accepts]: Start accepts. Automaton has 27452 states and 30859 transitions. Word has length 273 [2019-11-23 20:55:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:42,875 INFO L462 AbstractCegarLoop]: Abstraction has 27452 states and 30859 transitions. [2019-11-23 20:55:42,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27452 states and 30859 transitions. [2019-11-23 20:55:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-23 20:55:42,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:42,890 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:42,890 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1179091367, now seen corresponding path program 1 times [2019-11-23 20:55:42,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:42,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100753139] [2019-11-23 20:55:42,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:43,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100753139] [2019-11-23 20:55:43,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:43,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:43,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466406208] [2019-11-23 20:55:43,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:43,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:43,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:43,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:43,811 INFO L87 Difference]: Start difference. First operand 27452 states and 30859 transitions. Second operand 4 states. [2019-11-23 20:55:45,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:45,071 INFO L93 Difference]: Finished difference Result 54913 states and 61737 transitions. [2019-11-23 20:55:45,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:45,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2019-11-23 20:55:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:45,094 INFO L225 Difference]: With dead ends: 54913 [2019-11-23 20:55:45,094 INFO L226 Difference]: Without dead ends: 27463 [2019-11-23 20:55:45,113 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:55:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27463 states. [2019-11-23 20:55:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27463 to 27452. [2019-11-23 20:55:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27452 states. [2019-11-23 20:55:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27452 states to 27452 states and 30487 transitions. [2019-11-23 20:55:45,534 INFO L78 Accepts]: Start accepts. Automaton has 27452 states and 30487 transitions. Word has length 274 [2019-11-23 20:55:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:45,534 INFO L462 AbstractCegarLoop]: Abstraction has 27452 states and 30487 transitions. [2019-11-23 20:55:45,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:45,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27452 states and 30487 transitions. [2019-11-23 20:55:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-23 20:55:45,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:45,542 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:45,542 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:45,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:45,543 INFO L82 PathProgramCache]: Analyzing trace with hash 949060149, now seen corresponding path program 1 times [2019-11-23 20:55:45,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:45,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008665] [2019-11-23 20:55:45,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:55:45,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008665] [2019-11-23 20:55:45,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:45,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:45,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549947585] [2019-11-23 20:55:45,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:45,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:45,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:45,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:45,771 INFO L87 Difference]: Start difference. First operand 27452 states and 30487 transitions. Second operand 3 states. [2019-11-23 20:55:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:46,820 INFO L93 Difference]: Finished difference Result 54499 states and 60525 transitions. [2019-11-23 20:55:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:46,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-11-23 20:55:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:46,844 INFO L225 Difference]: With dead ends: 54499 [2019-11-23 20:55:46,844 INFO L226 Difference]: Without dead ends: 27049 [2019-11-23 20:55:46,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:46,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27049 states. [2019-11-23 20:55:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27049 to 26234. [2019-11-23 20:55:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26234 states. [2019-11-23 20:55:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26234 states to 26234 states and 28597 transitions. [2019-11-23 20:55:47,078 INFO L78 Accepts]: Start accepts. Automaton has 26234 states and 28597 transitions. Word has length 291 [2019-11-23 20:55:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:47,078 INFO L462 AbstractCegarLoop]: Abstraction has 26234 states and 28597 transitions. [2019-11-23 20:55:47,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 26234 states and 28597 transitions. [2019-11-23 20:55:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-23 20:55:47,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:47,086 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:47,086 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:47,087 INFO L82 PathProgramCache]: Analyzing trace with hash -610774499, now seen corresponding path program 1 times [2019-11-23 20:55:47,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:47,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841719117] [2019-11-23 20:55:47,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:55:47,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841719117] [2019-11-23 20:55:47,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:47,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:47,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206463808] [2019-11-23 20:55:47,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:47,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:47,491 INFO L87 Difference]: Start difference. First operand 26234 states and 28597 transitions. Second operand 4 states. [2019-11-23 20:55:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:48,144 INFO L93 Difference]: Finished difference Result 96195 states and 104970 transitions. [2019-11-23 20:55:48,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:48,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 295 [2019-11-23 20:55:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:48,201 INFO L225 Difference]: With dead ends: 96195 [2019-11-23 20:55:48,201 INFO L226 Difference]: Without dead ends: 69963 [2019-11-23 20:55:48,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69963 states. [2019-11-23 20:55:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69963 to 43730. [2019-11-23 20:55:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43730 states. [2019-11-23 20:55:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43730 states to 43730 states and 47809 transitions. [2019-11-23 20:55:48,860 INFO L78 Accepts]: Start accepts. Automaton has 43730 states and 47809 transitions. Word has length 295 [2019-11-23 20:55:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:48,861 INFO L462 AbstractCegarLoop]: Abstraction has 43730 states and 47809 transitions. [2019-11-23 20:55:48,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 43730 states and 47809 transitions. [2019-11-23 20:55:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-23 20:55:48,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:48,870 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 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, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,870 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:48,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2137282212, now seen corresponding path program 1 times [2019-11-23 20:55:48,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:48,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048570697] [2019-11-23 20:55:48,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-23 20:55:49,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048570697] [2019-11-23 20:55:49,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:49,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:55:49,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980312949] [2019-11-23 20:55:49,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:49,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:55:49,013 INFO L87 Difference]: Start difference. First operand 43730 states and 47809 transitions. Second operand 3 states. [2019-11-23 20:55:50,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:50,357 INFO L93 Difference]: Finished difference Result 107397 states and 117252 transitions. [2019-11-23 20:55:50,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:50,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-23 20:55:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:50,438 INFO L225 Difference]: With dead ends: 107397 [2019-11-23 20:55:50,438 INFO L226 Difference]: Without dead ends: 63669 [2019-11-23 20:55:50,471 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:55:50,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63669 states. [2019-11-23 20:55:51,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63669 to 62849. [2019-11-23 20:55:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62849 states. [2019-11-23 20:55:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62849 states to 62849 states and 68508 transitions. [2019-11-23 20:55:51,316 INFO L78 Accepts]: Start accepts. Automaton has 62849 states and 68508 transitions. Word has length 312 [2019-11-23 20:55:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:51,316 INFO L462 AbstractCegarLoop]: Abstraction has 62849 states and 68508 transitions. [2019-11-23 20:55:51,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:55:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 62849 states and 68508 transitions. [2019-11-23 20:55:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-23 20:55:51,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:51,331 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,331 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -726429955, now seen corresponding path program 1 times [2019-11-23 20:55:51,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:51,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261545307] [2019-11-23 20:55:51,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-23 20:55:51,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261545307] [2019-11-23 20:55:51,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:55:51,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:55:51,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035721259] [2019-11-23 20:55:51,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:55:51,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:51,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:55:51,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:55:51,641 INFO L87 Difference]: Start difference. First operand 62849 states and 68508 transitions. Second operand 4 states. [2019-11-23 20:55:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:53,407 INFO L93 Difference]: Finished difference Result 179985 states and 196200 transitions. [2019-11-23 20:55:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:55:53,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-11-23 20:55:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:53,513 INFO L225 Difference]: With dead ends: 179985 [2019-11-23 20:55:53,513 INFO L226 Difference]: Without dead ends: 114905 [2019-11-23 20:55:53,548 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:55:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114905 states. [2019-11-23 20:55:56,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114905 to 114089. [2019-11-23 20:55:56,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114089 states. [2019-11-23 20:55:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114089 states to 114089 states and 122855 transitions. [2019-11-23 20:55:56,587 INFO L78 Accepts]: Start accepts. Automaton has 114089 states and 122855 transitions. Word has length 316 [2019-11-23 20:55:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:55:56,587 INFO L462 AbstractCegarLoop]: Abstraction has 114089 states and 122855 transitions. [2019-11-23 20:55:56,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:55:56,587 INFO L276 IsEmpty]: Start isEmpty. Operand 114089 states and 122855 transitions. [2019-11-23 20:55:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-23 20:55:56,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:55:56,599 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:55:56,599 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:55:56,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:55:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 737149007, now seen corresponding path program 1 times [2019-11-23 20:55:56,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:55:56,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109743156] [2019-11-23 20:55:56,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:55:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-11-23 20:55:56,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109743156] [2019-11-23 20:55:56,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004038485] [2019-11-23 20:55:56,770 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:55:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:55:56,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-23 20:55:57,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:55:57,124 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-23 20:55:57,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:55:57,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-23 20:55:57,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822695514] [2019-11-23 20:55:57,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:55:57,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:55:57,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:55:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:57,127 INFO L87 Difference]: Start difference. First operand 114089 states and 122855 transitions. Second operand 3 states. [2019-11-23 20:55:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:55:58,538 INFO L93 Difference]: Finished difference Result 315164 states and 339265 transitions. [2019-11-23 20:55:58,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:55:58,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-11-23 20:55:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:55:58,764 INFO L225 Difference]: With dead ends: 315164 [2019-11-23 20:55:58,764 INFO L226 Difference]: Without dead ends: 201077 [2019-11-23 20:55:58,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-23 20:55:58,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201077 states. [2019-11-23 20:56:02,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201077 to 194975. [2019-11-23 20:56:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194975 states. [2019-11-23 20:56:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194975 states to 194975 states and 208856 transitions. [2019-11-23 20:56:02,934 INFO L78 Accepts]: Start accepts. Automaton has 194975 states and 208856 transitions. Word has length 319 [2019-11-23 20:56:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:02,934 INFO L462 AbstractCegarLoop]: Abstraction has 194975 states and 208856 transitions. [2019-11-23 20:56:02,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 194975 states and 208856 transitions. [2019-11-23 20:56:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-23 20:56:02,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:02,951 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:56:03,152 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:03,153 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1179445477, now seen corresponding path program 1 times [2019-11-23 20:56:03,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:03,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96043580] [2019-11-23 20:56:03,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 168 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-23 20:56:03,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96043580] [2019-11-23 20:56:03,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956032761] [2019-11-23 20:56:03,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:03,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:03,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-23 20:56:03,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:03,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-23 20:56:03,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413187962] [2019-11-23 20:56:03,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:03,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:03,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:03,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:03,778 INFO L87 Difference]: Start difference. First operand 194975 states and 208856 transitions. Second operand 3 states. [2019-11-23 20:56:06,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:06,071 INFO L93 Difference]: Finished difference Result 368214 states and 393954 transitions. [2019-11-23 20:56:06,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:06,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2019-11-23 20:56:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:06,408 INFO L225 Difference]: With dead ends: 368214 [2019-11-23 20:56:06,408 INFO L226 Difference]: Without dead ends: 173241 [2019-11-23 20:56:06,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-23 20:56:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173241 states. [2019-11-23 20:56:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173241 to 163273. [2019-11-23 20:56:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163273 states. [2019-11-23 20:56:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163273 states to 163273 states and 172719 transitions. [2019-11-23 20:56:12,600 INFO L78 Accepts]: Start accepts. Automaton has 163273 states and 172719 transitions. Word has length 324 [2019-11-23 20:56:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:12,601 INFO L462 AbstractCegarLoop]: Abstraction has 163273 states and 172719 transitions. [2019-11-23 20:56:12,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 163273 states and 172719 transitions. [2019-11-23 20:56:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-23 20:56:12,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:12,687 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:12,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:12,891 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:12,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1540453437, now seen corresponding path program 1 times [2019-11-23 20:56:12,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:12,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600166311] [2019-11-23 20:56:12,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 203 proven. 28 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-23 20:56:13,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600166311] [2019-11-23 20:56:13,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452858739] [2019-11-23 20:56:13,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:13,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:56:13,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:56:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-11-23 20:56:13,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:56:13,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-23 20:56:13,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515071404] [2019-11-23 20:56:13,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:56:13,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:13,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:56:13,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:56:13,702 INFO L87 Difference]: Start difference. First operand 163273 states and 172719 transitions. Second operand 3 states. [2019-11-23 20:56:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:56:15,373 INFO L93 Difference]: Finished difference Result 454236 states and 480669 transitions. [2019-11-23 20:56:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:56:15,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-11-23 20:56:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:56:15,726 INFO L225 Difference]: With dead ends: 454236 [2019-11-23 20:56:15,726 INFO L226 Difference]: Without dead ends: 290965 [2019-11-23 20:56:15,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 373 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:56:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290965 states. [2019-11-23 20:56:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290965 to 284647. [2019-11-23 20:56:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284647 states. [2019-11-23 20:56:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284647 states to 284647 states and 301457 transitions. [2019-11-23 20:56:22,684 INFO L78 Accepts]: Start accepts. Automaton has 284647 states and 301457 transitions. Word has length 373 [2019-11-23 20:56:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:56:22,684 INFO L462 AbstractCegarLoop]: Abstraction has 284647 states and 301457 transitions. [2019-11-23 20:56:22,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:56:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 284647 states and 301457 transitions. [2019-11-23 20:56:22,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-11-23 20:56:22,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:56:22,728 INFO L410 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,930 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:56:22,930 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:56:22,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:56:22,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1120257218, now seen corresponding path program 1 times [2019-11-23 20:56:22,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:56:22,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866358788] [2019-11-23 20:56:22,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:56:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:56:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-23 20:56:23,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866358788] [2019-11-23 20:56:23,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:56:23,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 20:56:23,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133395798] [2019-11-23 20:56:23,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:56:23,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:56:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:56:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:56:23,333 INFO L87 Difference]: Start difference. First operand 284647 states and 301457 transitions. Second operand 5 states.