java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:04,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:04,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:04,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:04,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:04,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:04,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:04,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:04,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:04,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:04,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:04,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:04,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:04,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:04,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:04,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:04,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:04,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:04,679 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:04,684 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:04,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:04,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:04,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:04,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:04,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:04,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:04,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:04,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:04,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:04,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:04,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:04,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:04,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:04,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:04,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:04,703 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:04,703 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:04,704 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:04,704 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:04,705 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:04,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:04,706 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-09-20 12:58:04,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:04,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:04,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:04,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:04,742 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:04,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:04,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:04,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:04,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:04,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:04,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:04,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:04,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:04,745 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:04,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:04,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:04,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:04,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:04,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:04,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:04,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:04,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:04,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:04,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:04,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:04,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:04,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:04,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:04,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:04,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:04,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:04,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:04,797 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:04,798 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:04,798 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-20 12:58:04,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02e7e9988/fb303d3ec409485b9e023bed1b0da408/FLAGee09df772 [2019-09-20 12:58:05,449 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:05,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-get-tag.i.p+sep-reducer.c [2019-09-20 12:58:05,476 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02e7e9988/fb303d3ec409485b9e023bed1b0da408/FLAGee09df772 [2019-09-20 12:58:05,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02e7e9988/fb303d3ec409485b9e023bed1b0da408 [2019-09-20 12:58:05,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:05,655 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:05,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:05,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:05,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:05,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:05" (1/1) ... [2019-09-20 12:58:05,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f7d25d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:05, skipping insertion in model container [2019-09-20 12:58:05,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:05" (1/1) ... [2019-09-20 12:58:05,672 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:05,772 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:06,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:06,703 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:06,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:06,965 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:06,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06 WrapperNode [2019-09-20 12:58:06,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:06,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:06,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:06,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:06,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:06,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:07,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:07,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:07,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:07,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:07,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (1/1) ... [2019-09-20 12:58:07,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:07,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:07,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:07,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:07,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (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-09-20 12:58:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:07,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:07,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:09,904 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:09,905 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 12:58:09,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:09 BoogieIcfgContainer [2019-09-20 12:58:09,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:09,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:09,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:09,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:09,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:05" (1/3) ... [2019-09-20 12:58:09,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da28bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:09, skipping insertion in model container [2019-09-20 12:58:09,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:06" (2/3) ... [2019-09-20 12:58:09,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da28bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:09, skipping insertion in model container [2019-09-20 12:58:09,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:09" (3/3) ... [2019-09-20 12:58:09,918 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.p+sep-reducer.c [2019-09-20 12:58:09,927 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:09,936 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-09-20 12:58:09,951 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-09-20 12:58:09,986 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:09,987 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:09,987 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:09,987 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:09,987 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:09,987 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:09,987 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:09,988 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:09,988 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:10,015 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-20 12:58:10,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-20 12:58:10,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:10,022 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:10,024 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:10,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1514750688, now seen corresponding path program 1 times [2019-09-20 12:58:10,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:10,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:10,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:10,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:10,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:10,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:10,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:58:10,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:58:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:58:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:58:10,252 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 4 states. [2019-09-20 12:58:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:11,707 INFO L93 Difference]: Finished difference Result 490 states and 915 transitions. [2019-09-20 12:58:11,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:58:11,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-09-20 12:58:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:11,724 INFO L225 Difference]: With dead ends: 490 [2019-09-20 12:58:11,724 INFO L226 Difference]: Without dead ends: 301 [2019-09-20 12:58:11,729 INFO L636 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-09-20 12:58:11,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-20 12:58:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2019-09-20 12:58:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-09-20 12:58:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 364 transitions. [2019-09-20 12:58:11,793 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 364 transitions. Word has length 11 [2019-09-20 12:58:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:11,794 INFO L475 AbstractCegarLoop]: Abstraction has 301 states and 364 transitions. [2019-09-20 12:58:11,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:58:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 364 transitions. [2019-09-20 12:58:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-20 12:58:11,795 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:11,795 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:11,796 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 287371989, now seen corresponding path program 1 times [2019-09-20 12:58:11,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:11,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:11,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:11,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:11,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:11,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:58:11,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:58:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:58:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:58:11,892 INFO L87 Difference]: Start difference. First operand 301 states and 364 transitions. Second operand 4 states. [2019-09-20 12:58:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:12,384 INFO L93 Difference]: Finished difference Result 301 states and 364 transitions. [2019-09-20 12:58:12,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:58:12,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-09-20 12:58:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:12,390 INFO L225 Difference]: With dead ends: 301 [2019-09-20 12:58:12,390 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 12:58:12,391 INFO L636 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-09-20 12:58:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 12:58:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2019-09-20 12:58:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-09-20 12:58:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 299 transitions. [2019-09-20 12:58:12,408 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 299 transitions. Word has length 12 [2019-09-20 12:58:12,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:12,408 INFO L475 AbstractCegarLoop]: Abstraction has 296 states and 299 transitions. [2019-09-20 12:58:12,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:58:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 299 transitions. [2019-09-20 12:58:12,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-20 12:58:12,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:12,417 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:12,418 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:12,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1097283636, now seen corresponding path program 1 times [2019-09-20 12:58:12,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:12,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:12,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:15,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:15,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2019-09-20 12:58:15,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-20 12:58:15,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-20 12:58:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2019-09-20 12:58:15,678 INFO L87 Difference]: Start difference. First operand 296 states and 299 transitions. Second operand 63 states. [2019-09-20 12:58:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:17,410 INFO L93 Difference]: Finished difference Result 297 states and 300 transitions. [2019-09-20 12:58:17,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-20 12:58:17,411 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 248 [2019-09-20 12:58:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:17,415 INFO L225 Difference]: With dead ends: 297 [2019-09-20 12:58:17,415 INFO L226 Difference]: Without dead ends: 295 [2019-09-20 12:58:17,417 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2019-09-20 12:58:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-20 12:58:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-20 12:58:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-20 12:58:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 297 transitions. [2019-09-20 12:58:17,434 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 297 transitions. Word has length 248 [2019-09-20 12:58:17,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:17,438 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 297 transitions. [2019-09-20 12:58:17,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-20 12:58:17,438 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 297 transitions. [2019-09-20 12:58:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-20 12:58:17,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:17,446 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:17,447 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash -343940819, now seen corresponding path program 1 times [2019-09-20 12:58:17,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:17,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:17,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:17,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:17,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:18,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:18,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:18,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:18,320 INFO L87 Difference]: Start difference. First operand 294 states and 297 transitions. Second operand 6 states. [2019-09-20 12:58:19,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:19,033 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2019-09-20 12:58:19,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:19,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 249 [2019-09-20 12:58:19,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:19,037 INFO L225 Difference]: With dead ends: 296 [2019-09-20 12:58:19,037 INFO L226 Difference]: Without dead ends: 294 [2019-09-20 12:58:19,038 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 119 SyntacticMatches, 59 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-09-20 12:58:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2019-09-20 12:58:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-20 12:58:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 295 transitions. [2019-09-20 12:58:19,050 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 295 transitions. Word has length 249 [2019-09-20 12:58:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:19,051 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 295 transitions. [2019-09-20 12:58:19,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 295 transitions. [2019-09-20 12:58:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-20 12:58:19,056 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:19,056 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:19,057 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1455800989, now seen corresponding path program 1 times [2019-09-20 12:58:19,058 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:19,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:19,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-20 12:58:22,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-20 12:58:22,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-20 12:58:22,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-20 12:58:22,039 INFO L87 Difference]: Start difference. First operand 292 states and 295 transitions. Second operand 65 states. [2019-09-20 12:58:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:23,730 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-09-20 12:58:23,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-20 12:58:23,736 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 252 [2019-09-20 12:58:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:23,739 INFO L225 Difference]: With dead ends: 295 [2019-09-20 12:58:23,739 INFO L226 Difference]: Without dead ends: 293 [2019-09-20 12:58:23,741 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 12:58:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-20 12:58:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2019-09-20 12:58:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-20 12:58:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 293 transitions. [2019-09-20 12:58:23,750 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 293 transitions. Word has length 252 [2019-09-20 12:58:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:23,751 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 293 transitions. [2019-09-20 12:58:23,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-20 12:58:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 293 transitions. [2019-09-20 12:58:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 12:58:23,760 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:23,760 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:23,761 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:23,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2114804744, now seen corresponding path program 1 times [2019-09-20 12:58:23,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:23,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:23,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:23,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:24,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:24,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:24,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:24,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:24,734 INFO L87 Difference]: Start difference. First operand 290 states and 293 transitions. Second operand 6 states. [2019-09-20 12:58:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:25,435 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2019-09-20 12:58:25,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:25,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-20 12:58:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:25,438 INFO L225 Difference]: With dead ends: 290 [2019-09-20 12:58:25,438 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 12:58:25,439 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 121 SyntacticMatches, 60 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-20 12:58:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 12:58:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2019-09-20 12:58:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-20 12:58:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 291 transitions. [2019-09-20 12:58:25,445 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 291 transitions. Word has length 253 [2019-09-20 12:58:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:25,446 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 291 transitions. [2019-09-20 12:58:25,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 291 transitions. [2019-09-20 12:58:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-20 12:58:25,448 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:25,448 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:25,449 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:25,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:25,449 INFO L82 PathProgramCache]: Analyzing trace with hash -807674468, now seen corresponding path program 1 times [2019-09-20 12:58:25,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:25,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:25,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:25,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:28,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:28,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-20 12:58:28,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-20 12:58:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-20 12:58:28,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 12:58:28,162 INFO L87 Difference]: Start difference. First operand 288 states and 291 transitions. Second operand 66 states. [2019-09-20 12:58:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:29,975 INFO L93 Difference]: Finished difference Result 298 states and 302 transitions. [2019-09-20 12:58:29,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-20 12:58:29,983 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 255 [2019-09-20 12:58:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:29,985 INFO L225 Difference]: With dead ends: 298 [2019-09-20 12:58:29,985 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 12:58:29,987 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-20 12:58:29,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 12:58:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 286. [2019-09-20 12:58:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-20 12:58:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 289 transitions. [2019-09-20 12:58:30,014 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 289 transitions. Word has length 255 [2019-09-20 12:58:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:30,014 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 289 transitions. [2019-09-20 12:58:30,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-20 12:58:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 289 transitions. [2019-09-20 12:58:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-20 12:58:30,016 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:30,016 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:30,017 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash 731900137, now seen corresponding path program 1 times [2019-09-20 12:58:30,018 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:30,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:30,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:30,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:30,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:30,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:30,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 12:58:30,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 12:58:30,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 12:58:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 12:58:30,185 INFO L87 Difference]: Start difference. First operand 286 states and 289 transitions. Second operand 4 states. [2019-09-20 12:58:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:30,510 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-09-20 12:58:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 12:58:30,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 256 [2019-09-20 12:58:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:30,513 INFO L225 Difference]: With dead ends: 286 [2019-09-20 12:58:30,514 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 12:58:30,514 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-09-20 12:58:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 12:58:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-09-20 12:58:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-20 12:58:30,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 285 transitions. [2019-09-20 12:58:30,523 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 285 transitions. Word has length 256 [2019-09-20 12:58:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:30,523 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 285 transitions. [2019-09-20 12:58:30,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 12:58:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 285 transitions. [2019-09-20 12:58:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 12:58:30,525 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:30,525 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:30,526 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:30,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1228876781, now seen corresponding path program 1 times [2019-09-20 12:58:30,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:30,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:30,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:30,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:33,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:33,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:33,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2019-09-20 12:58:33,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-20 12:58:33,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-20 12:58:33,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 12:58:33,249 INFO L87 Difference]: Start difference. First operand 282 states and 285 transitions. Second operand 66 states. [2019-09-20 12:58:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:34,601 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2019-09-20 12:58:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-20 12:58:34,603 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 257 [2019-09-20 12:58:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:34,606 INFO L225 Difference]: With dead ends: 292 [2019-09-20 12:58:34,606 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 12:58:34,607 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2147, Invalid=2275, Unknown=0, NotChecked=0, Total=4422 [2019-09-20 12:58:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 12:58:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2019-09-20 12:58:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-20 12:58:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 283 transitions. [2019-09-20 12:58:34,614 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 283 transitions. Word has length 257 [2019-09-20 12:58:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:34,615 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 283 transitions. [2019-09-20 12:58:34,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-20 12:58:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 283 transitions. [2019-09-20 12:58:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-20 12:58:34,616 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:34,617 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:34,617 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1227337581, now seen corresponding path program 1 times [2019-09-20 12:58:34,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:34,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:34,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:34,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:37,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:37,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2019-09-20 12:58:37,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-20 12:58:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-20 12:58:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2019-09-20 12:58:37,518 INFO L87 Difference]: Start difference. First operand 280 states and 283 transitions. Second operand 65 states. [2019-09-20 12:58:39,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:39,074 INFO L93 Difference]: Finished difference Result 298 states and 303 transitions. [2019-09-20 12:58:39,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-20 12:58:39,075 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 257 [2019-09-20 12:58:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:39,078 INFO L225 Difference]: With dead ends: 298 [2019-09-20 12:58:39,078 INFO L226 Difference]: Without dead ends: 296 [2019-09-20 12:58:39,080 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2019-09-20 12:58:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-20 12:58:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2019-09-20 12:58:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-20 12:58:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 281 transitions. [2019-09-20 12:58:39,086 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 281 transitions. Word has length 257 [2019-09-20 12:58:39,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:39,087 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 281 transitions. [2019-09-20 12:58:39,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-20 12:58:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 281 transitions. [2019-09-20 12:58:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-20 12:58:39,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:39,089 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 12:58:39,090 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -559126279, now seen corresponding path program 1 times [2019-09-20 12:58:39,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:39,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat