/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/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:34:40,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:34:40,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:34:40,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:34:40,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:34:40,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:34:40,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:34:40,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:34:40,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:34:40,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:34:40,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:34:40,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:34:40,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:34:40,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:34:40,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:34:40,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:34:40,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:34:40,208 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:34:40,210 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:34:40,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:34:40,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:34:40,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:34:40,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:34:40,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:34:40,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:34:40,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:34:40,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:34:40,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:34:40,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:34:40,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:34:40,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:34:40,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:34:40,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:34:40,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:34:40,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:34:40,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:34:40,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:34:40,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:34:40,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:34:40,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:34:40,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:34:40,242 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 22:34:40,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:34:40,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:34:40,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:34:40,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:34:40,263 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:34:40,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:34:40,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:34:40,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:34:40,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:34:40,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:34:40,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:34:40,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:34:40,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:34:40,265 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:34:40,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:34:40,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:34:40,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:34:40,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:34:40,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:34:40,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:34:40,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:34:40,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:34:40,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:40,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:34:40,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:34:40,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:34:40,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:34:40,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:34:40,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:34:40,269 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:34:40,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:34:40,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:34:40,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:34:40,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:34:40,558 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:34:40,559 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:34:40,621 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0167a671e/9d49f078874f46d6829a22b451c23ba6/FLAG79acd5e3e [2019-11-23 22:34:41,253 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:34:41,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:34:41,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0167a671e/9d49f078874f46d6829a22b451c23ba6/FLAG79acd5e3e [2019-11-23 22:34:41,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0167a671e/9d49f078874f46d6829a22b451c23ba6 [2019-11-23 22:34:41,475 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:34:41,476 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:34:41,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:41,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:34:41,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:34:41,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:41" (1/1) ... [2019-11-23 22:34:41,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51012342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:41, skipping insertion in model container [2019-11-23 22:34:41,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:41" (1/1) ... [2019-11-23 22:34:41,493 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:34:41,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:34:42,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:42,314 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:34:42,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:42,686 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:34:42,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42 WrapperNode [2019-11-23 22:34:42,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:42,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:42,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:34:42,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:34:42,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:42,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:34:42,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:34:42,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:34:42,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... [2019-11-23 22:34:42,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:34:42,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:34:42,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:34:42,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:34:42,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:42,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:34:42,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:34:44,734 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:34:44,735 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:34:44,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:44 BoogieIcfgContainer [2019-11-23 22:34:44,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:34:44,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:34:44,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:34:44,748 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:34:44,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:41" (1/3) ... [2019-11-23 22:34:44,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50793c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:44, skipping insertion in model container [2019-11-23 22:34:44,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:42" (2/3) ... [2019-11-23 22:34:44,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50793c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:44, skipping insertion in model container [2019-11-23 22:34:44,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:44" (3/3) ... [2019-11-23 22:34:44,755 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-11-23 22:34:44,764 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:34:44,775 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:34:44,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:34:44,830 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:34:44,830 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:34:44,831 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:34:44,831 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:34:44,831 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:34:44,832 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:34:44,832 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:34:44,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:34:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states. [2019-11-23 22:34:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:34:44,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:44,895 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] [2019-11-23 22:34:44,896 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash -969410714, now seen corresponding path program 1 times [2019-11-23 22:34:44,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:44,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458429340] [2019-11-23 22:34:44,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:45,538 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 22:34:45,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458429340] [2019-11-23 22:34:45,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:45,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:45,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244473181] [2019-11-23 22:34:45,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:45,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:45,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:45,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:45,565 INFO L87 Difference]: Start difference. First operand 413 states. Second operand 3 states. [2019-11-23 22:34:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:45,781 INFO L93 Difference]: Finished difference Result 742 states and 1300 transitions. [2019-11-23 22:34:45,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:45,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-23 22:34:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:45,815 INFO L225 Difference]: With dead ends: 742 [2019-11-23 22:34:45,816 INFO L226 Difference]: Without dead ends: 595 [2019-11-23 22:34:45,824 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 22:34:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-11-23 22:34:45,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 593. [2019-11-23 22:34:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-11-23 22:34:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 872 transitions. [2019-11-23 22:34:45,934 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 872 transitions. Word has length 148 [2019-11-23 22:34:45,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:45,936 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 872 transitions. [2019-11-23 22:34:45,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:45,937 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 872 transitions. [2019-11-23 22:34:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-23 22:34:45,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:45,940 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] [2019-11-23 22:34:45,940 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:45,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1257328890, now seen corresponding path program 1 times [2019-11-23 22:34:45,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:45,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127373001] [2019-11-23 22:34:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:46,398 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 22:34:46,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127373001] [2019-11-23 22:34:46,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:46,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:46,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254908450] [2019-11-23 22:34:46,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:46,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:46,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:46,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:46,402 INFO L87 Difference]: Start difference. First operand 593 states and 872 transitions. Second operand 4 states. [2019-11-23 22:34:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:46,571 INFO L93 Difference]: Finished difference Result 1733 states and 2539 transitions. [2019-11-23 22:34:46,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:46,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-23 22:34:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:46,579 INFO L225 Difference]: With dead ends: 1733 [2019-11-23 22:34:46,579 INFO L226 Difference]: Without dead ends: 1149 [2019-11-23 22:34:46,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:46,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2019-11-23 22:34:46,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1123. [2019-11-23 22:34:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-11-23 22:34:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1643 transitions. [2019-11-23 22:34:46,663 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1643 transitions. Word has length 148 [2019-11-23 22:34:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:46,663 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1643 transitions. [2019-11-23 22:34:46,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:46,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1643 transitions. [2019-11-23 22:34:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:34:46,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:46,671 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] [2019-11-23 22:34:46,671 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:46,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:46,672 INFO L82 PathProgramCache]: Analyzing trace with hash 56469786, now seen corresponding path program 1 times [2019-11-23 22:34:46,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:46,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368381272] [2019-11-23 22:34:46,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:46,757 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 22:34:46,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368381272] [2019-11-23 22:34:46,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:46,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:46,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150585394] [2019-11-23 22:34:46,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:46,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:46,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:46,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:46,763 INFO L87 Difference]: Start difference. First operand 1123 states and 1643 transitions. Second operand 3 states. [2019-11-23 22:34:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:46,875 INFO L93 Difference]: Finished difference Result 3331 states and 4867 transitions. [2019-11-23 22:34:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:46,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-23 22:34:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:46,887 INFO L225 Difference]: With dead ends: 3331 [2019-11-23 22:34:46,887 INFO L226 Difference]: Without dead ends: 2236 [2019-11-23 22:34:46,889 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 22:34:46,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2019-11-23 22:34:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 1125. [2019-11-23 22:34:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-11-23 22:34:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1645 transitions. [2019-11-23 22:34:46,954 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1645 transitions. Word has length 149 [2019-11-23 22:34:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:46,954 INFO L462 AbstractCegarLoop]: Abstraction has 1125 states and 1645 transitions. [2019-11-23 22:34:46,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1645 transitions. [2019-11-23 22:34:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:34:46,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:46,958 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] [2019-11-23 22:34:46,958 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:46,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1493517127, now seen corresponding path program 1 times [2019-11-23 22:34:46,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:46,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314928372] [2019-11-23 22:34:46,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:47,117 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 22:34:47,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314928372] [2019-11-23 22:34:47,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:47,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:47,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988426712] [2019-11-23 22:34:47,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:47,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:47,119 INFO L87 Difference]: Start difference. First operand 1125 states and 1645 transitions. Second operand 4 states. [2019-11-23 22:34:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:47,184 INFO L93 Difference]: Finished difference Result 2236 states and 3269 transitions. [2019-11-23 22:34:47,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:47,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:34:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:47,190 INFO L225 Difference]: With dead ends: 2236 [2019-11-23 22:34:47,190 INFO L226 Difference]: Without dead ends: 1125 [2019-11-23 22:34:47,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-11-23 22:34:47,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1124. [2019-11-23 22:34:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-23 22:34:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1642 transitions. [2019-11-23 22:34:47,241 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1642 transitions. Word has length 150 [2019-11-23 22:34:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:47,241 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1642 transitions. [2019-11-23 22:34:47,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1642 transitions. [2019-11-23 22:34:47,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:34:47,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:47,244 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] [2019-11-23 22:34:47,245 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:47,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2004697853, now seen corresponding path program 1 times [2019-11-23 22:34:47,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:47,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210956581] [2019-11-23 22:34:47,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:47,464 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 22:34:47,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210956581] [2019-11-23 22:34:47,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:47,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:47,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538381647] [2019-11-23 22:34:47,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:47,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:47,467 INFO L87 Difference]: Start difference. First operand 1124 states and 1642 transitions. Second operand 4 states. [2019-11-23 22:34:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:47,530 INFO L93 Difference]: Finished difference Result 2239 states and 3271 transitions. [2019-11-23 22:34:47,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:47,531 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-11-23 22:34:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:47,536 INFO L225 Difference]: With dead ends: 2239 [2019-11-23 22:34:47,538 INFO L226 Difference]: Without dead ends: 1122 [2019-11-23 22:34:47,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:47,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2019-11-23 22:34:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1122. [2019-11-23 22:34:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-11-23 22:34:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1638 transitions. [2019-11-23 22:34:47,589 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1638 transitions. Word has length 150 [2019-11-23 22:34:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:47,590 INFO L462 AbstractCegarLoop]: Abstraction has 1122 states and 1638 transitions. [2019-11-23 22:34:47,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1638 transitions. [2019-11-23 22:34:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-23 22:34:47,593 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:47,593 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] [2019-11-23 22:34:47,593 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:47,594 INFO L82 PathProgramCache]: Analyzing trace with hash -305501024, now seen corresponding path program 1 times [2019-11-23 22:34:47,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:47,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644742923] [2019-11-23 22:34:47,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:47,686 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 22:34:47,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644742923] [2019-11-23 22:34:47,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:47,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:47,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091508214] [2019-11-23 22:34:47,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:47,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:47,690 INFO L87 Difference]: Start difference. First operand 1122 states and 1638 transitions. Second operand 3 states. [2019-11-23 22:34:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:47,812 INFO L93 Difference]: Finished difference Result 2607 states and 3809 transitions. [2019-11-23 22:34:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:47,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-23 22:34:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:47,821 INFO L225 Difference]: With dead ends: 2607 [2019-11-23 22:34:47,821 INFO L226 Difference]: Without dead ends: 1677 [2019-11-23 22:34:47,825 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 22:34:47,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2019-11-23 22:34:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1651. [2019-11-23 22:34:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1651 states. [2019-11-23 22:34:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2385 transitions. [2019-11-23 22:34:47,903 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2385 transitions. Word has length 150 [2019-11-23 22:34:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:47,904 INFO L462 AbstractCegarLoop]: Abstraction has 1651 states and 2385 transitions. [2019-11-23 22:34:47,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2385 transitions. [2019-11-23 22:34:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-23 22:34:47,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:47,908 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] [2019-11-23 22:34:47,909 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:47,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:47,909 INFO L82 PathProgramCache]: Analyzing trace with hash -297624959, now seen corresponding path program 1 times [2019-11-23 22:34:47,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:47,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094900174] [2019-11-23 22:34:47,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:48,032 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 22:34:48,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094900174] [2019-11-23 22:34:48,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:48,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:48,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707953443] [2019-11-23 22:34:48,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:48,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:48,038 INFO L87 Difference]: Start difference. First operand 1651 states and 2385 transitions. Second operand 3 states. [2019-11-23 22:34:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:48,181 INFO L93 Difference]: Finished difference Result 3857 states and 5696 transitions. [2019-11-23 22:34:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:48,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-23 22:34:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:48,192 INFO L225 Difference]: With dead ends: 3857 [2019-11-23 22:34:48,192 INFO L226 Difference]: Without dead ends: 2391 [2019-11-23 22:34:48,199 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 22:34:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-11-23 22:34:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2075. [2019-11-23 22:34:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2019-11-23 22:34:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3076 transitions. [2019-11-23 22:34:48,300 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3076 transitions. Word has length 152 [2019-11-23 22:34:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:48,301 INFO L462 AbstractCegarLoop]: Abstraction has 2075 states and 3076 transitions. [2019-11-23 22:34:48,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:48,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3076 transitions. [2019-11-23 22:34:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-23 22:34:48,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:48,305 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] [2019-11-23 22:34:48,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:48,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1401811482, now seen corresponding path program 1 times [2019-11-23 22:34:48,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:48,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285464623] [2019-11-23 22:34:48,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:48,374 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 22:34:48,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285464623] [2019-11-23 22:34:48,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:48,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:48,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342988192] [2019-11-23 22:34:48,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:48,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:48,376 INFO L87 Difference]: Start difference. First operand 2075 states and 3076 transitions. Second operand 3 states. [2019-11-23 22:34:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:48,596 INFO L93 Difference]: Finished difference Result 4927 states and 7467 transitions. [2019-11-23 22:34:48,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:48,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-23 22:34:48,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:48,618 INFO L225 Difference]: With dead ends: 4927 [2019-11-23 22:34:48,619 INFO L226 Difference]: Without dead ends: 3121 [2019-11-23 22:34:48,623 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 22:34:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2019-11-23 22:34:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 2829. [2019-11-23 22:34:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2019-11-23 22:34:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4294 transitions. [2019-11-23 22:34:48,899 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4294 transitions. Word has length 154 [2019-11-23 22:34:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:48,899 INFO L462 AbstractCegarLoop]: Abstraction has 2829 states and 4294 transitions. [2019-11-23 22:34:48,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4294 transitions. [2019-11-23 22:34:48,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-23 22:34:48,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:48,906 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] [2019-11-23 22:34:48,907 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash -725008649, now seen corresponding path program 1 times [2019-11-23 22:34:48,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:48,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864620030] [2019-11-23 22:34:48,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:49,182 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 22:34:49,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864620030] [2019-11-23 22:34:49,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:49,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:49,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415523739] [2019-11-23 22:34:49,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:49,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:49,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:49,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:49,188 INFO L87 Difference]: Start difference. First operand 2829 states and 4294 transitions. Second operand 4 states. [2019-11-23 22:34:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:49,483 INFO L93 Difference]: Finished difference Result 7334 states and 11133 transitions. [2019-11-23 22:34:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:49,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-11-23 22:34:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:49,504 INFO L225 Difference]: With dead ends: 7334 [2019-11-23 22:34:49,505 INFO L226 Difference]: Without dead ends: 4532 [2019-11-23 22:34:49,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:49,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2019-11-23 22:34:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4509. [2019-11-23 22:34:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4509 states. [2019-11-23 22:34:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6792 transitions. [2019-11-23 22:34:49,815 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 6792 transitions. Word has length 155 [2019-11-23 22:34:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:49,816 INFO L462 AbstractCegarLoop]: Abstraction has 4509 states and 6792 transitions. [2019-11-23 22:34:49,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:34:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 6792 transitions. [2019-11-23 22:34:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:34:49,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:49,821 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] [2019-11-23 22:34:49,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1128800555, now seen corresponding path program 1 times [2019-11-23 22:34:49,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:49,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107113965] [2019-11-23 22:34:49,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:49,900 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 22:34:49,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107113965] [2019-11-23 22:34:49,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:49,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:49,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032733450] [2019-11-23 22:34:49,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:49,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:49,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:49,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:49,903 INFO L87 Difference]: Start difference. First operand 4509 states and 6792 transitions. Second operand 3 states. [2019-11-23 22:34:50,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:50,306 INFO L93 Difference]: Finished difference Result 11124 states and 16810 transitions. [2019-11-23 22:34:50,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:50,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:34:50,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:50,341 INFO L225 Difference]: With dead ends: 11124 [2019-11-23 22:34:50,341 INFO L226 Difference]: Without dead ends: 6983 [2019-11-23 22:34:50,349 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 22:34:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2019-11-23 22:34:50,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 6962. [2019-11-23 22:34:50,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6962 states. [2019-11-23 22:34:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 10375 transitions. [2019-11-23 22:34:50,807 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 10375 transitions. Word has length 157 [2019-11-23 22:34:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:50,807 INFO L462 AbstractCegarLoop]: Abstraction has 6962 states and 10375 transitions. [2019-11-23 22:34:50,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 10375 transitions. [2019-11-23 22:34:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-23 22:34:50,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:50,817 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] [2019-11-23 22:34:50,817 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1784803505, now seen corresponding path program 1 times [2019-11-23 22:34:50,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:50,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444311111] [2019-11-23 22:34:50,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:50,883 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 22:34:50,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444311111] [2019-11-23 22:34:50,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:50,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:50,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924436157] [2019-11-23 22:34:50,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:50,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:50,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:50,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:50,885 INFO L87 Difference]: Start difference. First operand 6962 states and 10375 transitions. Second operand 3 states. [2019-11-23 22:34:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:51,408 INFO L93 Difference]: Finished difference Result 17925 states and 27159 transitions. [2019-11-23 22:34:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:51,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-23 22:34:51,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:51,437 INFO L225 Difference]: With dead ends: 17925 [2019-11-23 22:34:51,437 INFO L226 Difference]: Without dead ends: 11300 [2019-11-23 22:34:51,448 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 22:34:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11300 states. [2019-11-23 22:34:52,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11300 to 10360. [2019-11-23 22:34:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10360 states. [2019-11-23 22:34:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 15798 transitions. [2019-11-23 22:34:52,177 INFO L78 Accepts]: Start accepts. Automaton has 10360 states and 15798 transitions. Word has length 161 [2019-11-23 22:34:52,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:52,177 INFO L462 AbstractCegarLoop]: Abstraction has 10360 states and 15798 transitions. [2019-11-23 22:34:52,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:52,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10360 states and 15798 transitions. [2019-11-23 22:34:52,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:34:52,184 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:52,184 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] [2019-11-23 22:34:52,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:52,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:52,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2036829176, now seen corresponding path program 1 times [2019-11-23 22:34:52,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:52,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300883185] [2019-11-23 22:34:52,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:52,451 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 22:34:52,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300883185] [2019-11-23 22:34:52,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:52,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:34:52,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368569987] [2019-11-23 22:34:52,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:34:52,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:52,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:34:52,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:52,454 INFO L87 Difference]: Start difference. First operand 10360 states and 15798 transitions. Second operand 9 states. [2019-11-23 22:34:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:56,112 INFO L93 Difference]: Finished difference Result 53192 states and 81967 transitions. [2019-11-23 22:34:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-23 22:34:56,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-11-23 22:34:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:56,224 INFO L225 Difference]: With dead ends: 53192 [2019-11-23 22:34:56,225 INFO L226 Difference]: Without dead ends: 43243 [2019-11-23 22:34:56,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:56,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43243 states. [2019-11-23 22:34:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43243 to 28402. [2019-11-23 22:34:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28402 states. [2019-11-23 22:34:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28402 states to 28402 states and 43279 transitions. [2019-11-23 22:34:58,071 INFO L78 Accepts]: Start accepts. Automaton has 28402 states and 43279 transitions. Word has length 162 [2019-11-23 22:34:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:58,071 INFO L462 AbstractCegarLoop]: Abstraction has 28402 states and 43279 transitions. [2019-11-23 22:34:58,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:34:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 28402 states and 43279 transitions. [2019-11-23 22:34:58,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:34:58,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:58,083 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] [2019-11-23 22:34:58,083 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1628279716, now seen corresponding path program 1 times [2019-11-23 22:34:58,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:58,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344768991] [2019-11-23 22:34:58,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:58,226 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 22:34:58,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344768991] [2019-11-23 22:34:58,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:58,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:58,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295093350] [2019-11-23 22:34:58,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:34:58,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:58,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:34:58,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:34:58,229 INFO L87 Difference]: Start difference. First operand 28402 states and 43279 transitions. Second operand 4 states. [2019-11-23 22:34:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:59,805 INFO L93 Difference]: Finished difference Result 58650 states and 91211 transitions. [2019-11-23 22:34:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:34:59,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:34:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:59,887 INFO L225 Difference]: With dead ends: 58650 [2019-11-23 22:34:59,887 INFO L226 Difference]: Without dead ends: 35856 [2019-11-23 22:34:59,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 22:34:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35856 states. [2019-11-23 22:35:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35856 to 35854. [2019-11-23 22:35:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35854 states. [2019-11-23 22:35:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35854 states to 35854 states and 54951 transitions. [2019-11-23 22:35:02,261 INFO L78 Accepts]: Start accepts. Automaton has 35854 states and 54951 transitions. Word has length 162 [2019-11-23 22:35:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:02,261 INFO L462 AbstractCegarLoop]: Abstraction has 35854 states and 54951 transitions. [2019-11-23 22:35:02,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 35854 states and 54951 transitions. [2019-11-23 22:35:02,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-23 22:35:02,272 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:02,273 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] [2019-11-23 22:35:02,273 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:02,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1086737409, now seen corresponding path program 1 times [2019-11-23 22:35:02,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:02,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709480995] [2019-11-23 22:35:02,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:02,451 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 22:35:02,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709480995] [2019-11-23 22:35:02,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:02,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:02,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327961134] [2019-11-23 22:35:02,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:02,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:02,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:02,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:02,455 INFO L87 Difference]: Start difference. First operand 35854 states and 54951 transitions. Second operand 4 states. [2019-11-23 22:35:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:05,256 INFO L93 Difference]: Finished difference Result 100154 states and 153129 transitions. [2019-11-23 22:35:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:05,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-11-23 22:35:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:05,364 INFO L225 Difference]: With dead ends: 100154 [2019-11-23 22:35:05,364 INFO L226 Difference]: Without dead ends: 64339 [2019-11-23 22:35:05,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64339 states. [2019-11-23 22:35:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64339 to 64287. [2019-11-23 22:35:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64287 states. [2019-11-23 22:35:09,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64287 states to 64287 states and 97232 transitions. [2019-11-23 22:35:09,674 INFO L78 Accepts]: Start accepts. Automaton has 64287 states and 97232 transitions. Word has length 162 [2019-11-23 22:35:09,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:09,675 INFO L462 AbstractCegarLoop]: Abstraction has 64287 states and 97232 transitions. [2019-11-23 22:35:09,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:09,675 INFO L276 IsEmpty]: Start isEmpty. Operand 64287 states and 97232 transitions. [2019-11-23 22:35:09,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-23 22:35:09,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:09,691 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] [2019-11-23 22:35:09,691 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:09,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2063857833, now seen corresponding path program 1 times [2019-11-23 22:35:09,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:09,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187527580] [2019-11-23 22:35:09,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:09,734 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 22:35:09,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187527580] [2019-11-23 22:35:09,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:09,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:09,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085882225] [2019-11-23 22:35:09,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:09,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:09,736 INFO L87 Difference]: Start difference. First operand 64287 states and 97232 transitions. Second operand 3 states. [2019-11-23 22:35:16,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:16,173 INFO L93 Difference]: Finished difference Result 192667 states and 291445 transitions. [2019-11-23 22:35:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:16,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-11-23 22:35:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:16,320 INFO L225 Difference]: With dead ends: 192667 [2019-11-23 22:35:16,320 INFO L226 Difference]: Without dead ends: 128486 [2019-11-23 22:35:16,364 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 22:35:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128486 states. [2019-11-23 22:35:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128486 to 64293. [2019-11-23 22:35:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64293 states. [2019-11-23 22:35:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64293 states to 64293 states and 97238 transitions. [2019-11-23 22:35:19,585 INFO L78 Accepts]: Start accepts. Automaton has 64293 states and 97238 transitions. Word has length 163 [2019-11-23 22:35:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:19,585 INFO L462 AbstractCegarLoop]: Abstraction has 64293 states and 97238 transitions. [2019-11-23 22:35:19,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 64293 states and 97238 transitions. [2019-11-23 22:35:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:19,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:19,600 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] [2019-11-23 22:35:19,600 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash -965969025, now seen corresponding path program 1 times [2019-11-23 22:35:19,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:19,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112358077] [2019-11-23 22:35:19,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:19,691 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 22:35:19,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112358077] [2019-11-23 22:35:19,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:19,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:19,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411967319] [2019-11-23 22:35:19,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:19,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:19,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:19,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:19,693 INFO L87 Difference]: Start difference. First operand 64293 states and 97238 transitions. Second operand 3 states. [2019-11-23 22:35:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:25,646 INFO L93 Difference]: Finished difference Result 169264 states and 255632 transitions. [2019-11-23 22:35:25,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:25,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-23 22:35:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:25,777 INFO L225 Difference]: With dead ends: 169264 [2019-11-23 22:35:25,777 INFO L226 Difference]: Without dead ends: 105726 [2019-11-23 22:35:25,818 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 22:35:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105726 states. [2019-11-23 22:35:30,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105726 to 105674. [2019-11-23 22:35:30,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105674 states. [2019-11-23 22:35:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105674 states to 105674 states and 157802 transitions. [2019-11-23 22:35:31,005 INFO L78 Accepts]: Start accepts. Automaton has 105674 states and 157802 transitions. Word has length 164 [2019-11-23 22:35:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:31,006 INFO L462 AbstractCegarLoop]: Abstraction has 105674 states and 157802 transitions. [2019-11-23 22:35:31,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 105674 states and 157802 transitions. [2019-11-23 22:35:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-23 22:35:31,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:31,023 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] [2019-11-23 22:35:31,023 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:31,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1642020452, now seen corresponding path program 1 times [2019-11-23 22:35:31,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:31,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379689731] [2019-11-23 22:35:31,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:31,174 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 22:35:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379689731] [2019-11-23 22:35:31,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:31,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:35:31,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836722550] [2019-11-23 22:35:31,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:35:31,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:35:31,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:35:31,177 INFO L87 Difference]: Start difference. First operand 105674 states and 157802 transitions. Second operand 4 states. [2019-11-23 22:35:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:37,895 INFO L93 Difference]: Finished difference Result 198577 states and 296719 transitions. [2019-11-23 22:35:37,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:35:37,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-23 22:35:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:38,010 INFO L225 Difference]: With dead ends: 198577 [2019-11-23 22:35:38,010 INFO L226 Difference]: Without dead ends: 93582 [2019-11-23 22:35:38,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93582 states. [2019-11-23 22:35:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93582 to 93582. [2019-11-23 22:35:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93582 states. [2019-11-23 22:35:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93582 states to 93582 states and 139715 transitions. [2019-11-23 22:35:42,686 INFO L78 Accepts]: Start accepts. Automaton has 93582 states and 139715 transitions. Word has length 164 [2019-11-23 22:35:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:42,686 INFO L462 AbstractCegarLoop]: Abstraction has 93582 states and 139715 transitions. [2019-11-23 22:35:42,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:35:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 93582 states and 139715 transitions. [2019-11-23 22:35:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-11-23 22:35:42,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:42,700 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, 1, 1, 1, 1] [2019-11-23 22:35:42,700 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:42,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1021080101, now seen corresponding path program 1 times [2019-11-23 22:35:42,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:42,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781726121] [2019-11-23 22:35:42,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:42,834 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 22:35:42,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781726121] [2019-11-23 22:35:42,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:42,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:35:42,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561332073] [2019-11-23 22:35:42,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:35:42,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:42,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:35:42,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:35:42,841 INFO L87 Difference]: Start difference. First operand 93582 states and 139715 transitions. Second operand 8 states.