/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_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:31:13,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:31:13,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:31:13,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:31:13,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:31:13,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:31:13,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:31:13,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:31:14,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:31:14,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:31:14,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:31:14,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:31:14,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:31:14,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:31:14,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:31:14,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:31:14,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:31:14,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:31:14,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:31:14,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:31:14,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:31:14,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:31:14,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:31:14,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:31:14,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:31:14,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:31:14,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:31:14,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:31:14,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:31:14,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:31:14,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:31:14,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:31:14,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:31:14,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:31:14,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:31:14,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:31:14,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:31:14,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:31:14,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:31:14,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:31:14,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:31:14,067 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:31:14,089 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:31:14,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:31:14,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:31:14,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:31:14,092 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:31:14,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:31:14,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:31:14,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:31:14,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:31:14,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:31:14,094 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:31:14,095 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:31:14,095 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:31:14,095 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:31:14,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:31:14,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:31:14,096 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:31:14,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:31:14,096 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:31:14,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:31:14,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:31:14,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:31:14,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:31:14,097 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:31:14,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:31:14,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:31:14,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:31:14,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:31:14,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:31:14,098 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:31:14,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:31:14,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:31:14,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:31:14,419 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:31:14,419 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:31:14,420 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:31:14,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd67f427/9e274e52be9146a7a98beec46528c74c/FLAGf88e362c4 [2019-11-23 22:31:15,063 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:31:15,063 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:31:15,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd67f427/9e274e52be9146a7a98beec46528c74c/FLAGf88e362c4 [2019-11-23 22:31:15,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd67f427/9e274e52be9146a7a98beec46528c74c [2019-11-23 22:31:15,288 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:31:15,290 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:31:15,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:15,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:31:15,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:31:15,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:15" (1/1) ... [2019-11-23 22:31:15,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d11b488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:15, skipping insertion in model container [2019-11-23 22:31:15,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:31:15" (1/1) ... [2019-11-23 22:31:15,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:31:15,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:31:15,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:16,010 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:31:16,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:31:16,500 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:31:16,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16 WrapperNode [2019-11-23 22:31:16,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:31:16,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:16,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:31:16,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:31:16,511 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:31:16" (1/1) ... [2019-11-23 22:31:16,549 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:31:16" (1/1) ... [2019-11-23 22:31:16,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:31:16,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:31:16,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:31:16,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:31:16,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (1/1) ... [2019-11-23 22:31:16,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:31:16,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:31:16,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:31:16,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:31:16,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (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:31:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:31:16,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:31:18,578 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:31:18,578 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:31:18,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:18 BoogieIcfgContainer [2019-11-23 22:31:18,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:31:18,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:31:18,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:31:18,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:31:18,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:31:15" (1/3) ... [2019-11-23 22:31:18,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86cd1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:18, skipping insertion in model container [2019-11-23 22:31:18,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:31:16" (2/3) ... [2019-11-23 22:31:18,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86cd1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:31:18, skipping insertion in model container [2019-11-23 22:31:18,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:31:18" (3/3) ... [2019-11-23 22:31:18,589 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-11-23 22:31:18,600 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:31:18,608 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-23 22:31:18,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-23 22:31:18,652 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:31:18,652 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:31:18,652 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:31:18,652 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:31:18,652 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:31:18,653 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:31:18,653 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:31:18,653 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:31:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states. [2019-11-23 22:31:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 22:31:18,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:18,707 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] [2019-11-23 22:31:18,708 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:31:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash -222442561, now seen corresponding path program 1 times [2019-11-23 22:31:18,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:18,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786816420] [2019-11-23 22:31:18,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:19,331 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:31:19,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786816420] [2019-11-23 22:31:19,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:19,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:19,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376541615] [2019-11-23 22:31:19,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:19,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:19,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:19,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:19,357 INFO L87 Difference]: Start difference. First operand 388 states. Second operand 3 states. [2019-11-23 22:31:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:19,607 INFO L93 Difference]: Finished difference Result 696 states and 1231 transitions. [2019-11-23 22:31:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:19,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-23 22:31:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:19,649 INFO L225 Difference]: With dead ends: 696 [2019-11-23 22:31:19,649 INFO L226 Difference]: Without dead ends: 555 [2019-11-23 22:31:19,656 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:31:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-11-23 22:31:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2019-11-23 22:31:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-11-23 22:31:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 808 transitions. [2019-11-23 22:31:19,789 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 808 transitions. Word has length 141 [2019-11-23 22:31:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:19,792 INFO L462 AbstractCegarLoop]: Abstraction has 553 states and 808 transitions. [2019-11-23 22:31:19,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 808 transitions. [2019-11-23 22:31:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-23 22:31:19,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:19,804 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] [2019-11-23 22:31:19,805 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:31:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash 493106975, now seen corresponding path program 1 times [2019-11-23 22:31:19,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:19,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711394027] [2019-11-23 22:31:19,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:20,257 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:31:20,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711394027] [2019-11-23 22:31:20,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:20,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:20,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463827780] [2019-11-23 22:31:20,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:20,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:20,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:20,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:20,263 INFO L87 Difference]: Start difference. First operand 553 states and 808 transitions. Second operand 4 states. [2019-11-23 22:31:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:20,457 INFO L93 Difference]: Finished difference Result 1618 states and 2357 transitions. [2019-11-23 22:31:20,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:20,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-11-23 22:31:20,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:20,466 INFO L225 Difference]: With dead ends: 1618 [2019-11-23 22:31:20,467 INFO L226 Difference]: Without dead ends: 1074 [2019-11-23 22:31:20,474 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:31:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-11-23 22:31:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1048. [2019-11-23 22:31:20,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-11-23 22:31:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1525 transitions. [2019-11-23 22:31:20,532 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1525 transitions. Word has length 141 [2019-11-23 22:31:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:20,533 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1525 transitions. [2019-11-23 22:31:20,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1525 transitions. [2019-11-23 22:31:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-23 22:31:20,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:20,536 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] [2019-11-23 22:31:20,537 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:31:20,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:20,537 INFO L82 PathProgramCache]: Analyzing trace with hash 472396363, now seen corresponding path program 1 times [2019-11-23 22:31:20,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:20,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608477463] [2019-11-23 22:31:20,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:20,615 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:31:20,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608477463] [2019-11-23 22:31:20,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:20,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:20,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205662532] [2019-11-23 22:31:20,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:20,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:20,620 INFO L87 Difference]: Start difference. First operand 1048 states and 1525 transitions. Second operand 3 states. [2019-11-23 22:31:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:20,706 INFO L93 Difference]: Finished difference Result 3106 states and 4513 transitions. [2019-11-23 22:31:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:20,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-11-23 22:31:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:20,718 INFO L225 Difference]: With dead ends: 3106 [2019-11-23 22:31:20,718 INFO L226 Difference]: Without dead ends: 2086 [2019-11-23 22:31:20,720 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:31:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-11-23 22:31:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1050. [2019-11-23 22:31:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1050 states. [2019-11-23 22:31:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1527 transitions. [2019-11-23 22:31:20,789 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1527 transitions. Word has length 142 [2019-11-23 22:31:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:20,790 INFO L462 AbstractCegarLoop]: Abstraction has 1050 states and 1527 transitions. [2019-11-23 22:31:20,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1527 transitions. [2019-11-23 22:31:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:31:20,793 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:20,793 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] [2019-11-23 22:31:20,793 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:31:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash -632784837, now seen corresponding path program 1 times [2019-11-23 22:31:20,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:20,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59802044] [2019-11-23 22:31:20,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:20,904 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:31:20,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59802044] [2019-11-23 22:31:20,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:20,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:20,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339644428] [2019-11-23 22:31:20,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:20,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:20,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:20,906 INFO L87 Difference]: Start difference. First operand 1050 states and 1527 transitions. Second operand 3 states. [2019-11-23 22:31:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:21,050 INFO L93 Difference]: Finished difference Result 2912 states and 4244 transitions. [2019-11-23 22:31:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:21,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-11-23 22:31:21,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:21,062 INFO L225 Difference]: With dead ends: 2912 [2019-11-23 22:31:21,062 INFO L226 Difference]: Without dead ends: 2038 [2019-11-23 22:31:21,064 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:31:21,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-11-23 22:31:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2012. [2019-11-23 22:31:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-11-23 22:31:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2908 transitions. [2019-11-23 22:31:21,161 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2908 transitions. Word has length 143 [2019-11-23 22:31:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:21,161 INFO L462 AbstractCegarLoop]: Abstraction has 2012 states and 2908 transitions. [2019-11-23 22:31:21,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:21,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2908 transitions. [2019-11-23 22:31:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-11-23 22:31:21,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:21,166 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] [2019-11-23 22:31:21,166 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:31:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 980377726, now seen corresponding path program 1 times [2019-11-23 22:31:21,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:21,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726196982] [2019-11-23 22:31:21,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:21,337 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:31:21,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726196982] [2019-11-23 22:31:21,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:21,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:21,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719361612] [2019-11-23 22:31:21,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:21,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:21,340 INFO L87 Difference]: Start difference. First operand 2012 states and 2908 transitions. Second operand 4 states. [2019-11-23 22:31:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:21,447 INFO L93 Difference]: Finished difference Result 3387 states and 4903 transitions. [2019-11-23 22:31:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:21,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-11-23 22:31:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:21,457 INFO L225 Difference]: With dead ends: 3387 [2019-11-23 22:31:21,459 INFO L226 Difference]: Without dead ends: 1541 [2019-11-23 22:31:21,462 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:31:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2019-11-23 22:31:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1541. [2019-11-23 22:31:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1541 states. [2019-11-23 22:31:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2216 transitions. [2019-11-23 22:31:21,639 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2216 transitions. Word has length 143 [2019-11-23 22:31:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:21,640 INFO L462 AbstractCegarLoop]: Abstraction has 1541 states and 2216 transitions. [2019-11-23 22:31:21,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2216 transitions. [2019-11-23 22:31:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:31:21,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:21,646 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:31:21,646 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:31:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash -322179093, now seen corresponding path program 1 times [2019-11-23 22:31:21,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:21,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064663553] [2019-11-23 22:31:21,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:22,133 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:31:22,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064663553] [2019-11-23 22:31:22,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:22,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:31:22,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564318272] [2019-11-23 22:31:22,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:31:22,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:31:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:22,136 INFO L87 Difference]: Start difference. First operand 1541 states and 2216 transitions. Second operand 9 states. [2019-11-23 22:31:22,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:22,831 INFO L93 Difference]: Finished difference Result 3065 states and 4566 transitions. [2019-11-23 22:31:22,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:22,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2019-11-23 22:31:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:22,845 INFO L225 Difference]: With dead ends: 3065 [2019-11-23 22:31:22,845 INFO L226 Difference]: Without dead ends: 2511 [2019-11-23 22:31:22,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2019-11-23 22:31:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2509. [2019-11-23 22:31:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2509 states. [2019-11-23 22:31:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 3654 transitions. [2019-11-23 22:31:23,080 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 3654 transitions. Word has length 149 [2019-11-23 22:31:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:23,081 INFO L462 AbstractCegarLoop]: Abstraction has 2509 states and 3654 transitions. [2019-11-23 22:31:23,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:31:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 3654 transitions. [2019-11-23 22:31:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-23 22:31:23,085 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:23,085 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:31:23,086 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:31:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 729598228, now seen corresponding path program 1 times [2019-11-23 22:31:23,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:23,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135489160] [2019-11-23 22:31:23,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:23,295 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:31:23,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135489160] [2019-11-23 22:31:23,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:23,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:23,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371928235] [2019-11-23 22:31:23,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:23,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:23,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:23,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:23,308 INFO L87 Difference]: Start difference. First operand 2509 states and 3654 transitions. Second operand 4 states. [2019-11-23 22:31:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:23,633 INFO L93 Difference]: Finished difference Result 6501 states and 9449 transitions. [2019-11-23 22:31:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:23,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-11-23 22:31:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:23,652 INFO L225 Difference]: With dead ends: 6501 [2019-11-23 22:31:23,652 INFO L226 Difference]: Without dead ends: 4011 [2019-11-23 22:31:23,658 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:31:23,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2019-11-23 22:31:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 3989. [2019-11-23 22:31:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3989 states. [2019-11-23 22:31:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3989 states to 3989 states and 5740 transitions. [2019-11-23 22:31:23,928 INFO L78 Accepts]: Start accepts. Automaton has 3989 states and 5740 transitions. Word has length 149 [2019-11-23 22:31:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:23,929 INFO L462 AbstractCegarLoop]: Abstraction has 3989 states and 5740 transitions. [2019-11-23 22:31:23,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:23,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3989 states and 5740 transitions. [2019-11-23 22:31:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:31:23,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:23,938 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] [2019-11-23 22:31:23,939 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:31:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -29149378, now seen corresponding path program 1 times [2019-11-23 22:31:23,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:23,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595360631] [2019-11-23 22:31:23,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:24,025 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:31:24,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595360631] [2019-11-23 22:31:24,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:24,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:24,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718660425] [2019-11-23 22:31:24,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:24,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:24,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:24,027 INFO L87 Difference]: Start difference. First operand 3989 states and 5740 transitions. Second operand 3 states. [2019-11-23 22:31:24,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:24,439 INFO L93 Difference]: Finished difference Result 11255 states and 16227 transitions. [2019-11-23 22:31:24,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:24,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-23 22:31:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:24,473 INFO L225 Difference]: With dead ends: 11255 [2019-11-23 22:31:24,474 INFO L226 Difference]: Without dead ends: 7615 [2019-11-23 22:31:24,481 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:31:24,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7615 states. [2019-11-23 22:31:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7615 to 7595. [2019-11-23 22:31:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2019-11-23 22:31:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 10825 transitions. [2019-11-23 22:31:24,926 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 10825 transitions. Word has length 151 [2019-11-23 22:31:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:24,926 INFO L462 AbstractCegarLoop]: Abstraction has 7595 states and 10825 transitions. [2019-11-23 22:31:24,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 10825 transitions. [2019-11-23 22:31:24,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-23 22:31:24,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:24,937 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] [2019-11-23 22:31:24,937 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:31:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1478647487, now seen corresponding path program 1 times [2019-11-23 22:31:24,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:24,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837071782] [2019-11-23 22:31:24,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:25,068 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:31:25,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837071782] [2019-11-23 22:31:25,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:25,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:25,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529334868] [2019-11-23 22:31:25,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:25,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:25,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:25,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:25,071 INFO L87 Difference]: Start difference. First operand 7595 states and 10825 transitions. Second operand 4 states. [2019-11-23 22:31:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:25,417 INFO L93 Difference]: Finished difference Result 12068 states and 17204 transitions. [2019-11-23 22:31:25,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:25,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-23 22:31:25,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:25,444 INFO L225 Difference]: With dead ends: 12068 [2019-11-23 22:31:25,444 INFO L226 Difference]: Without dead ends: 6187 [2019-11-23 22:31:25,451 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:31:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2019-11-23 22:31:25,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 6187. [2019-11-23 22:31:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6187 states. [2019-11-23 22:31:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 8789 transitions. [2019-11-23 22:31:25,707 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 8789 transitions. Word has length 151 [2019-11-23 22:31:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:25,707 INFO L462 AbstractCegarLoop]: Abstraction has 6187 states and 8789 transitions. [2019-11-23 22:31:25,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 8789 transitions. [2019-11-23 22:31:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:31:25,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:25,717 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:31:25,717 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:31:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:25,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1573675502, now seen corresponding path program 1 times [2019-11-23 22:31:25,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:25,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761763808] [2019-11-23 22:31:25,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:25,794 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:31:25,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761763808] [2019-11-23 22:31:25,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:25,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:25,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646609400] [2019-11-23 22:31:25,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:25,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:25,797 INFO L87 Difference]: Start difference. First operand 6187 states and 8789 transitions. Second operand 3 states. [2019-11-23 22:31:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:26,516 INFO L93 Difference]: Finished difference Result 16607 states and 23878 transitions. [2019-11-23 22:31:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:26,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-11-23 22:31:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:26,538 INFO L225 Difference]: With dead ends: 16607 [2019-11-23 22:31:26,538 INFO L226 Difference]: Without dead ends: 11599 [2019-11-23 22:31:26,547 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:31:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11599 states. [2019-11-23 22:31:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11599 to 11565. [2019-11-23 22:31:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11565 states. [2019-11-23 22:31:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11565 states to 11565 states and 16446 transitions. [2019-11-23 22:31:27,135 INFO L78 Accepts]: Start accepts. Automaton has 11565 states and 16446 transitions. Word has length 157 [2019-11-23 22:31:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:27,136 INFO L462 AbstractCegarLoop]: Abstraction has 11565 states and 16446 transitions. [2019-11-23 22:31:27,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 11565 states and 16446 transitions. [2019-11-23 22:31:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:31:27,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:27,155 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:31:27,156 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:31:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:27,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2004430153, now seen corresponding path program 1 times [2019-11-23 22:31:27,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:27,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744926150] [2019-11-23 22:31:27,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:27,406 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:31:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744926150] [2019-11-23 22:31:27,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:27,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:31:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401480545] [2019-11-23 22:31:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:31:27,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:31:27,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:27,408 INFO L87 Difference]: Start difference. First operand 11565 states and 16446 transitions. Second operand 9 states. [2019-11-23 22:31:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:28,454 INFO L93 Difference]: Finished difference Result 23721 states and 34435 transitions. [2019-11-23 22:31:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:28,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 157 [2019-11-23 22:31:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:28,491 INFO L225 Difference]: With dead ends: 23721 [2019-11-23 22:31:28,491 INFO L226 Difference]: Without dead ends: 18715 [2019-11-23 22:31:28,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:31:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2019-11-23 22:31:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 18713. [2019-11-23 22:31:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18713 states. [2019-11-23 22:31:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18713 states to 18713 states and 26295 transitions. [2019-11-23 22:31:29,880 INFO L78 Accepts]: Start accepts. Automaton has 18713 states and 26295 transitions. Word has length 157 [2019-11-23 22:31:29,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:29,880 INFO L462 AbstractCegarLoop]: Abstraction has 18713 states and 26295 transitions. [2019-11-23 22:31:29,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:31:29,881 INFO L276 IsEmpty]: Start isEmpty. Operand 18713 states and 26295 transitions. [2019-11-23 22:31:29,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-23 22:31:29,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:29,900 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:31:29,900 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:31:29,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:29,900 INFO L82 PathProgramCache]: Analyzing trace with hash 144369562, now seen corresponding path program 1 times [2019-11-23 22:31:29,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:29,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677094863] [2019-11-23 22:31:29,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:30,068 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:31:30,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677094863] [2019-11-23 22:31:30,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:30,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:30,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517239886] [2019-11-23 22:31:30,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:30,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:30,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:30,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:30,071 INFO L87 Difference]: Start difference. First operand 18713 states and 26295 transitions. Second operand 4 states. [2019-11-23 22:31:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:31,542 INFO L93 Difference]: Finished difference Result 54834 states and 76816 transitions. [2019-11-23 22:31:31,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:31,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-23 22:31:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:31,587 INFO L225 Difference]: With dead ends: 54834 [2019-11-23 22:31:31,587 INFO L226 Difference]: Without dead ends: 36160 [2019-11-23 22:31:31,610 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:31:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36160 states. [2019-11-23 22:31:33,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36160 to 36110. [2019-11-23 22:31:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36110 states. [2019-11-23 22:31:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36110 states to 36110 states and 50044 transitions. [2019-11-23 22:31:33,817 INFO L78 Accepts]: Start accepts. Automaton has 36110 states and 50044 transitions. Word has length 157 [2019-11-23 22:31:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:33,817 INFO L462 AbstractCegarLoop]: Abstraction has 36110 states and 50044 transitions. [2019-11-23 22:31:33,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:33,817 INFO L276 IsEmpty]: Start isEmpty. Operand 36110 states and 50044 transitions. [2019-11-23 22:31:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-23 22:31:33,849 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:33,849 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] [2019-11-23 22:31:33,849 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:31:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:33,850 INFO L82 PathProgramCache]: Analyzing trace with hash 877745476, now seen corresponding path program 1 times [2019-11-23 22:31:33,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:33,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265685634] [2019-11-23 22:31:33,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:33,897 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:31:33,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265685634] [2019-11-23 22:31:33,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:33,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:33,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777401218] [2019-11-23 22:31:33,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:33,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:33,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:33,899 INFO L87 Difference]: Start difference. First operand 36110 states and 50044 transitions. Second operand 3 states. [2019-11-23 22:31:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:35,869 INFO L93 Difference]: Finished difference Result 108140 states and 149885 transitions. [2019-11-23 22:31:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:35,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-23 22:31:35,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:35,944 INFO L225 Difference]: With dead ends: 108140 [2019-11-23 22:31:35,945 INFO L226 Difference]: Without dead ends: 72134 [2019-11-23 22:31:35,987 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:31:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72134 states. [2019-11-23 22:31:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72134 to 36116. [2019-11-23 22:31:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36116 states. [2019-11-23 22:31:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36116 states to 36116 states and 50050 transitions. [2019-11-23 22:31:38,778 INFO L78 Accepts]: Start accepts. Automaton has 36116 states and 50050 transitions. Word has length 158 [2019-11-23 22:31:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:38,778 INFO L462 AbstractCegarLoop]: Abstraction has 36116 states and 50050 transitions. [2019-11-23 22:31:38,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36116 states and 50050 transitions. [2019-11-23 22:31:38,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:31:38,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:38,798 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] [2019-11-23 22:31:38,799 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:31:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1285244370, now seen corresponding path program 1 times [2019-11-23 22:31:38,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:38,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260265649] [2019-11-23 22:31:38,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:38,894 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:31:38,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260265649] [2019-11-23 22:31:38,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:38,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:31:38,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357362313] [2019-11-23 22:31:38,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:31:38,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:31:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:31:38,897 INFO L87 Difference]: Start difference. First operand 36116 states and 50050 transitions. Second operand 3 states. [2019-11-23 22:31:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:41,632 INFO L93 Difference]: Finished difference Result 97832 states and 134998 transitions. [2019-11-23 22:31:41,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:31:41,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-11-23 22:31:41,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:41,689 INFO L225 Difference]: With dead ends: 97832 [2019-11-23 22:31:41,689 INFO L226 Difference]: Without dead ends: 62650 [2019-11-23 22:31:41,714 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:31:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62650 states. [2019-11-23 22:31:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62650 to 62600. [2019-11-23 22:31:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62600 states. [2019-11-23 22:31:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62600 states to 62600 states and 85110 transitions. [2019-11-23 22:31:45,510 INFO L78 Accepts]: Start accepts. Automaton has 62600 states and 85110 transitions. Word has length 159 [2019-11-23 22:31:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:45,510 INFO L462 AbstractCegarLoop]: Abstraction has 62600 states and 85110 transitions. [2019-11-23 22:31:45,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:31:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 62600 states and 85110 transitions. [2019-11-23 22:31:45,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-23 22:31:45,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:45,538 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] [2019-11-23 22:31:45,539 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:31:45,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:45,539 INFO L82 PathProgramCache]: Analyzing trace with hash -839851627, now seen corresponding path program 1 times [2019-11-23 22:31:45,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:45,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571323281] [2019-11-23 22:31:45,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:45,665 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:31:45,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571323281] [2019-11-23 22:31:45,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:45,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:31:45,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296549226] [2019-11-23 22:31:45,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:31:45,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:31:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:31:45,667 INFO L87 Difference]: Start difference. First operand 62600 states and 85110 transitions. Second operand 4 states. [2019-11-23 22:31:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:48,173 INFO L93 Difference]: Finished difference Result 115325 states and 156998 transitions. [2019-11-23 22:31:48,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:31:48,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-11-23 22:31:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:48,219 INFO L225 Difference]: With dead ends: 115325 [2019-11-23 22:31:48,219 INFO L226 Difference]: Without dead ends: 53541 [2019-11-23 22:31:48,248 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:31:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53541 states. [2019-11-23 22:31:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53541 to 53541. [2019-11-23 22:31:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53541 states. [2019-11-23 22:31:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53541 states to 53541 states and 72862 transitions. [2019-11-23 22:31:50,323 INFO L78 Accepts]: Start accepts. Automaton has 53541 states and 72862 transitions. Word has length 159 [2019-11-23 22:31:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:31:50,323 INFO L462 AbstractCegarLoop]: Abstraction has 53541 states and 72862 transitions. [2019-11-23 22:31:50,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:31:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53541 states and 72862 transitions. [2019-11-23 22:31:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:31:50,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:31:50,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:31:50,352 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:31:50,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:31:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -696954949, now seen corresponding path program 1 times [2019-11-23 22:31:50,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:31:50,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934027741] [2019-11-23 22:31:50,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:31:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:31:50,796 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:31:50,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934027741] [2019-11-23 22:31:50,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:31:50,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:31:50,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413920368] [2019-11-23 22:31:50,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:31:50,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:31:50,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:31:50,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:31:50,800 INFO L87 Difference]: Start difference. First operand 53541 states and 72862 transitions. Second operand 15 states. [2019-11-23 22:31:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:31:59,366 INFO L93 Difference]: Finished difference Result 134624 states and 188665 transitions. [2019-11-23 22:31:59,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 22:31:59,366 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 165 [2019-11-23 22:31:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:31:59,479 INFO L225 Difference]: With dead ends: 134624 [2019-11-23 22:31:59,479 INFO L226 Difference]: Without dead ends: 126458 [2019-11-23 22:31:59,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=925, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:31:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126458 states. [2019-11-23 22:32:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126458 to 59230. [2019-11-23 22:32:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59230 states. [2019-11-23 22:32:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59230 states to 59230 states and 79607 transitions. [2019-11-23 22:32:02,792 INFO L78 Accepts]: Start accepts. Automaton has 59230 states and 79607 transitions. Word has length 165 [2019-11-23 22:32:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:02,792 INFO L462 AbstractCegarLoop]: Abstraction has 59230 states and 79607 transitions. [2019-11-23 22:32:02,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:32:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 59230 states and 79607 transitions. [2019-11-23 22:32:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:32:02,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:02,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:02,821 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:32:02,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:02,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1953616288, now seen corresponding path program 1 times [2019-11-23 22:32:02,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:02,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894657042] [2019-11-23 22:32:02,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:03,095 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:32:03,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894657042] [2019-11-23 22:32:03,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:03,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-23 22:32:03,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937323458] [2019-11-23 22:32:03,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-23 22:32:03,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:03,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-23 22:32:03,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-23 22:32:03,100 INFO L87 Difference]: Start difference. First operand 59230 states and 79607 transitions. Second operand 10 states. [2019-11-23 22:32:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:06,557 INFO L93 Difference]: Finished difference Result 110781 states and 148923 transitions. [2019-11-23 22:32:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:32:06,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 165 [2019-11-23 22:32:06,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:06,640 INFO L225 Difference]: With dead ends: 110781 [2019-11-23 22:32:06,641 INFO L226 Difference]: Without dead ends: 59230 [2019-11-23 22:32:06,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-23 22:32:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59230 states. [2019-11-23 22:32:12,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59230 to 59230. [2019-11-23 22:32:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59230 states. [2019-11-23 22:32:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59230 states to 59230 states and 78558 transitions. [2019-11-23 22:32:12,754 INFO L78 Accepts]: Start accepts. Automaton has 59230 states and 78558 transitions. Word has length 165 [2019-11-23 22:32:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:12,754 INFO L462 AbstractCegarLoop]: Abstraction has 59230 states and 78558 transitions. [2019-11-23 22:32:12,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-23 22:32:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 59230 states and 78558 transitions. [2019-11-23 22:32:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:32:12,781 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:12,781 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:12,781 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:32:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2070838316, now seen corresponding path program 1 times [2019-11-23 22:32:12,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:12,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418444733] [2019-11-23 22:32:12,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:13,142 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:32:13,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418444733] [2019-11-23 22:32:13,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:13,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-23 22:32:13,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933330345] [2019-11-23 22:32:13,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-23 22:32:13,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:13,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-23 22:32:13,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-23 22:32:13,144 INFO L87 Difference]: Start difference. First operand 59230 states and 78558 transitions. Second operand 13 states. [2019-11-23 22:32:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:19,897 INFO L93 Difference]: Finished difference Result 106581 states and 145762 transitions. [2019-11-23 22:32:19,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:32:19,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 165 [2019-11-23 22:32:19,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:19,982 INFO L225 Difference]: With dead ends: 106581 [2019-11-23 22:32:19,982 INFO L226 Difference]: Without dead ends: 94987 [2019-11-23 22:32:20,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-11-23 22:32:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94987 states. [2019-11-23 22:32:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94987 to 64852. [2019-11-23 22:32:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64852 states. [2019-11-23 22:32:24,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64852 states to 64852 states and 85291 transitions. [2019-11-23 22:32:24,150 INFO L78 Accepts]: Start accepts. Automaton has 64852 states and 85291 transitions. Word has length 165 [2019-11-23 22:32:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:24,151 INFO L462 AbstractCegarLoop]: Abstraction has 64852 states and 85291 transitions. [2019-11-23 22:32:24,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-23 22:32:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 64852 states and 85291 transitions. [2019-11-23 22:32:24,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-23 22:32:24,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:24,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:32:24,181 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1721342044, now seen corresponding path program 1 times [2019-11-23 22:32:24,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:24,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077678498] [2019-11-23 22:32:24,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:24,335 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:32:24,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077678498] [2019-11-23 22:32:24,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:24,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:24,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989624909] [2019-11-23 22:32:24,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:24,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:24,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:24,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:24,337 INFO L87 Difference]: Start difference. First operand 64852 states and 85291 transitions. Second operand 4 states. [2019-11-23 22:32:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:32:27,780 INFO L93 Difference]: Finished difference Result 121868 states and 160113 transitions. [2019-11-23 22:32:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 22:32:27,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-11-23 22:32:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:32:27,833 INFO L225 Difference]: With dead ends: 121868 [2019-11-23 22:32:27,834 INFO L226 Difference]: Without dead ends: 57552 [2019-11-23 22:32:27,864 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:32:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57552 states. [2019-11-23 22:32:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57552 to 57376. [2019-11-23 22:32:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57376 states. [2019-11-23 22:32:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57376 states to 57376 states and 75223 transitions. [2019-11-23 22:32:31,749 INFO L78 Accepts]: Start accepts. Automaton has 57376 states and 75223 transitions. Word has length 165 [2019-11-23 22:32:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:32:31,749 INFO L462 AbstractCegarLoop]: Abstraction has 57376 states and 75223 transitions. [2019-11-23 22:32:31,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 22:32:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 57376 states and 75223 transitions. [2019-11-23 22:32:31,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-23 22:32:31,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:32:31,778 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] [2019-11-23 22:32:31,778 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:32:31,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:32:31,778 INFO L82 PathProgramCache]: Analyzing trace with hash 690176028, now seen corresponding path program 1 times [2019-11-23 22:32:31,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:32:31,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200609164] [2019-11-23 22:32:31,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:32:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:32:31,985 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:32:31,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200609164] [2019-11-23 22:32:31,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:32:31,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:32:31,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692800864] [2019-11-23 22:32:31,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 22:32:31,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:32:31,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 22:32:31,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 22:32:31,989 INFO L87 Difference]: Start difference. First operand 57376 states and 75223 transitions. Second operand 4 states.