/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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:19:36,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:19:36,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:19:36,580 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:19:36,580 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:19:36,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:19:36,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:19:36,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:19:36,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:19:36,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:19:36,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:19:36,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:19:36,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:19:36,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:19:36,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:19:36,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:19:36,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:19:36,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:19:36,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:19:36,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:19:36,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:19:36,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:19:36,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:19:36,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:19:36,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:19:36,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:19:36,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:19:36,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:19:36,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:19:36,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:19:36,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:19:36,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:19:36,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:19:36,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:19:36,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:19:36,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:19:36,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:19:36,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:19:36,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:19:36,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:19:36,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:19:36,615 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-06 21:19:36,639 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:19:36,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:19:36,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:19:36,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:19:36,641 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:19:36,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:19:36,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:19:36,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:19:36,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:19:36,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:19:36,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:19:36,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:19:36,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:19:36,645 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:19:36,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:19:36,645 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:19:36,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:19:36,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:19:36,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:19:36,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:19:36,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:19:36,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:19:36,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:19:36,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:19:36,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:19:36,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:19:36,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:19:36,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:19:36,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:19:36,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:19:37,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:19:37,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:19:37,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:19:37,011 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:19:37,011 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2019-11-06 21:19:37,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460632a60/e11d2909abfe433daef73c8359bd799e/FLAG46451bd1d [2019-11-06 21:19:37,527 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:19:37,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2019-11-06 21:19:37,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460632a60/e11d2909abfe433daef73c8359bd799e/FLAG46451bd1d [2019-11-06 21:19:37,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/460632a60/e11d2909abfe433daef73c8359bd799e [2019-11-06 21:19:37,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:19:37,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:19:37,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:37,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:19:37,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:19:37,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:37" (1/1) ... [2019-11-06 21:19:37,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f99a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:37, skipping insertion in model container [2019-11-06 21:19:37,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:19:37" (1/1) ... [2019-11-06 21:19:37,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:19:37,972 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:19:38,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:38,174 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:19:38,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:19:38,330 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:19:38,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38 WrapperNode [2019-11-06 21:19:38,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:19:38,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:19:38,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:19:38,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:19:38,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (1/1) ... [2019-11-06 21:19:38,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:19:38,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:19:38,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:19:38,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:19:38,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (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-06 21:19:38,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:19:38,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:19:38,427 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:19:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:19:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:19:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:19:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:19:38,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:19:38,785 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:19:38,786 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 21:19:38,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:38 BoogieIcfgContainer [2019-11-06 21:19:38,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:19:38,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:19:38,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:19:38,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:19:38,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:19:37" (1/3) ... [2019-11-06 21:19:38,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e820382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:38, skipping insertion in model container [2019-11-06 21:19:38,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:19:38" (2/3) ... [2019-11-06 21:19:38,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e820382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:19:38, skipping insertion in model container [2019-11-06 21:19:38,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:19:38" (3/3) ... [2019-11-06 21:19:38,812 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2019-11-06 21:19:38,829 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:19:38,840 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:19:38,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:19:38,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:19:38,874 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:19:38,874 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:19:38,874 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:19:38,874 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:19:38,874 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:19:38,875 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:19:38,875 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:19:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2019-11-06 21:19:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:19:38,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:38,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] [2019-11-06 21:19:38,902 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:38,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:38,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2019-11-06 21:19:38,914 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:38,915 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346001199] [2019-11-06 21:19:38,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,124 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-06 21:19:39,124 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346001199] [2019-11-06 21:19:39,125 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,126 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926542597] [2019-11-06 21:19:39,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,133 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,150 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2019-11-06 21:19:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:39,210 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2019-11-06 21:19:39,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:39,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:19:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:39,236 INFO L225 Difference]: With dead ends: 99 [2019-11-06 21:19:39,236 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 21:19:39,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 21:19:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-11-06 21:19:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-06 21:19:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2019-11-06 21:19:39,325 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2019-11-06 21:19:39,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,326 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2019-11-06 21:19:39,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2019-11-06 21:19:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:19:39,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,329 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] [2019-11-06 21:19:39,330 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2019-11-06 21:19:39,331 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,332 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751232028] [2019-11-06 21:19:39,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,435 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-06 21:19:39,435 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751232028] [2019-11-06 21:19:39,435 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,436 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064417067] [2019-11-06 21:19:39,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,438 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,439 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2019-11-06 21:19:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:39,467 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2019-11-06 21:19:39,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:39,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-06 21:19:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:39,470 INFO L225 Difference]: With dead ends: 137 [2019-11-06 21:19:39,470 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 21:19:39,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 21:19:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-11-06 21:19:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-06 21:19:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2019-11-06 21:19:39,483 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2019-11-06 21:19:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,484 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2019-11-06 21:19:39,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2019-11-06 21:19:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:19:39,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,486 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] [2019-11-06 21:19:39,486 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2019-11-06 21:19:39,487 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,487 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820091401] [2019-11-06 21:19:39,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,562 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-06 21:19:39,562 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820091401] [2019-11-06 21:19:39,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,568 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624106895] [2019-11-06 21:19:39,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,569 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,570 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2019-11-06 21:19:39,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:39,613 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2019-11-06 21:19:39,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:39,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:19:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:39,618 INFO L225 Difference]: With dead ends: 126 [2019-11-06 21:19:39,618 INFO L226 Difference]: Without dead ends: 87 [2019-11-06 21:19:39,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:39,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-06 21:19:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-11-06 21:19:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-06 21:19:39,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2019-11-06 21:19:39,642 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2019-11-06 21:19:39,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,645 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2019-11-06 21:19:39,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2019-11-06 21:19:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:19:39,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,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] [2019-11-06 21:19:39,647 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,647 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2019-11-06 21:19:39,647 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,647 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269124658] [2019-11-06 21:19:39,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,736 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-06 21:19:39,738 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269124658] [2019-11-06 21:19:39,738 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,738 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935700791] [2019-11-06 21:19:39,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,739 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,741 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2019-11-06 21:19:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:39,775 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2019-11-06 21:19:39,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:39,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:19:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:39,779 INFO L225 Difference]: With dead ends: 160 [2019-11-06 21:19:39,779 INFO L226 Difference]: Without dead ends: 158 [2019-11-06 21:19:39,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-06 21:19:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2019-11-06 21:19:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-06 21:19:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2019-11-06 21:19:39,794 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2019-11-06 21:19:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,794 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2019-11-06 21:19:39,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2019-11-06 21:19:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 21:19:39,796 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,796 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] [2019-11-06 21:19:39,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2019-11-06 21:19:39,797 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,797 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141210542] [2019-11-06 21:19:39,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:39,851 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-06 21:19:39,852 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141210542] [2019-11-06 21:19:39,852 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:39,852 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:39,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776211897] [2019-11-06 21:19:39,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:39,853 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:39,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:39,854 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2019-11-06 21:19:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:39,885 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2019-11-06 21:19:39,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:39,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-06 21:19:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:39,889 INFO L225 Difference]: With dead ends: 264 [2019-11-06 21:19:39,889 INFO L226 Difference]: Without dead ends: 160 [2019-11-06 21:19:39,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-06 21:19:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-06 21:19:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-06 21:19:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2019-11-06 21:19:39,924 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2019-11-06 21:19:39,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:39,924 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2019-11-06 21:19:39,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:39,925 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2019-11-06 21:19:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:39,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:39,926 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] [2019-11-06 21:19:39,926 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:39,927 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2019-11-06 21:19:39,927 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:39,927 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100049938] [2019-11-06 21:19:39,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,004 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-06 21:19:40,004 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100049938] [2019-11-06 21:19:40,004 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,005 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550317655] [2019-11-06 21:19:40,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,007 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,008 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2019-11-06 21:19:40,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,044 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2019-11-06 21:19:40,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,047 INFO L225 Difference]: With dead ends: 237 [2019-11-06 21:19:40,047 INFO L226 Difference]: Without dead ends: 162 [2019-11-06 21:19:40,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-06 21:19:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2019-11-06 21:19:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-06 21:19:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2019-11-06 21:19:40,070 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2019-11-06 21:19:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,070 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2019-11-06 21:19:40,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,070 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2019-11-06 21:19:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:40,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,072 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] [2019-11-06 21:19:40,072 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,072 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2019-11-06 21:19:40,073 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,073 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053582679] [2019-11-06 21:19:40,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,099 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-06 21:19:40,100 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053582679] [2019-11-06 21:19:40,100 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,100 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857475327] [2019-11-06 21:19:40,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,101 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,102 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2019-11-06 21:19:40,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,130 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2019-11-06 21:19:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,133 INFO L225 Difference]: With dead ends: 300 [2019-11-06 21:19:40,133 INFO L226 Difference]: Without dead ends: 298 [2019-11-06 21:19:40,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-06 21:19:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2019-11-06 21:19:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-06 21:19:40,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-06 21:19:40,145 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2019-11-06 21:19:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,146 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-06 21:19:40,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,146 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-06 21:19:40,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:19:40,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,148 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] [2019-11-06 21:19:40,148 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2019-11-06 21:19:40,149 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,149 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034704855] [2019-11-06 21:19:40,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,179 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-06 21:19:40,180 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034704855] [2019-11-06 21:19:40,180 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,180 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614441885] [2019-11-06 21:19:40,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,181 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,182 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2019-11-06 21:19:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,227 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2019-11-06 21:19:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-06 21:19:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,232 INFO L225 Difference]: With dead ends: 512 [2019-11-06 21:19:40,232 INFO L226 Difference]: Without dead ends: 306 [2019-11-06 21:19:40,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-06 21:19:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-11-06 21:19:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-11-06 21:19:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2019-11-06 21:19:40,252 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2019-11-06 21:19:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,252 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2019-11-06 21:19:40,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2019-11-06 21:19:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:40,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,257 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] [2019-11-06 21:19:40,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2019-11-06 21:19:40,258 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,259 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438543361] [2019-11-06 21:19:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,306 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-06 21:19:40,306 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438543361] [2019-11-06 21:19:40,307 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,307 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846723088] [2019-11-06 21:19:40,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,308 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,308 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2019-11-06 21:19:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,328 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2019-11-06 21:19:40,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,330 INFO L225 Difference]: With dead ends: 456 [2019-11-06 21:19:40,331 INFO L226 Difference]: Without dead ends: 310 [2019-11-06 21:19:40,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-06 21:19:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2019-11-06 21:19:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-06 21:19:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2019-11-06 21:19:40,343 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2019-11-06 21:19:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,343 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2019-11-06 21:19:40,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2019-11-06 21:19:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:40,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,344 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] [2019-11-06 21:19:40,345 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2019-11-06 21:19:40,345 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,345 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925663916] [2019-11-06 21:19:40,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,370 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-06 21:19:40,370 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925663916] [2019-11-06 21:19:40,370 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,370 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336024528] [2019-11-06 21:19:40,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,371 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,372 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2019-11-06 21:19:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,396 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2019-11-06 21:19:40,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,401 INFO L225 Difference]: With dead ends: 572 [2019-11-06 21:19:40,402 INFO L226 Difference]: Without dead ends: 570 [2019-11-06 21:19:40,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-06 21:19:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2019-11-06 21:19:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-06 21:19:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2019-11-06 21:19:40,417 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2019-11-06 21:19:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,417 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2019-11-06 21:19:40,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2019-11-06 21:19:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 21:19:40,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,419 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] [2019-11-06 21:19:40,419 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2019-11-06 21:19:40,420 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,420 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609950544] [2019-11-06 21:19:40,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,443 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-06 21:19:40,443 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609950544] [2019-11-06 21:19:40,443 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,444 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121865416] [2019-11-06 21:19:40,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,444 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,445 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2019-11-06 21:19:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,470 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2019-11-06 21:19:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-06 21:19:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,474 INFO L225 Difference]: With dead ends: 1004 [2019-11-06 21:19:40,474 INFO L226 Difference]: Without dead ends: 594 [2019-11-06 21:19:40,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-06 21:19:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2019-11-06 21:19:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-06 21:19:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2019-11-06 21:19:40,493 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2019-11-06 21:19:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,493 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2019-11-06 21:19:40,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2019-11-06 21:19:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:40,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,495 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] [2019-11-06 21:19:40,495 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2019-11-06 21:19:40,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116750104] [2019-11-06 21:19:40,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,520 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-06 21:19:40,520 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116750104] [2019-11-06 21:19:40,520 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,520 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316598401] [2019-11-06 21:19:40,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,521 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,522 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2019-11-06 21:19:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,542 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2019-11-06 21:19:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,546 INFO L225 Difference]: With dead ends: 888 [2019-11-06 21:19:40,546 INFO L226 Difference]: Without dead ends: 602 [2019-11-06 21:19:40,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-11-06 21:19:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2019-11-06 21:19:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-06 21:19:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2019-11-06 21:19:40,564 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2019-11-06 21:19:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,565 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2019-11-06 21:19:40,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2019-11-06 21:19:40,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:40,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,566 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] [2019-11-06 21:19:40,567 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2019-11-06 21:19:40,567 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,567 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673959061] [2019-11-06 21:19:40,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,587 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-06 21:19:40,587 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673959061] [2019-11-06 21:19:40,588 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,588 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40659556] [2019-11-06 21:19:40,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,589 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,589 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2019-11-06 21:19:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,615 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2019-11-06 21:19:40,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:40,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,621 INFO L225 Difference]: With dead ends: 1100 [2019-11-06 21:19:40,622 INFO L226 Difference]: Without dead ends: 1098 [2019-11-06 21:19:40,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2019-11-06 21:19:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2019-11-06 21:19:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-06 21:19:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2019-11-06 21:19:40,654 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2019-11-06 21:19:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,654 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2019-11-06 21:19:40,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2019-11-06 21:19:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:19:40,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,657 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] [2019-11-06 21:19:40,657 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2019-11-06 21:19:40,658 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,658 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046086514] [2019-11-06 21:19:40,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,682 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-06 21:19:40,682 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046086514] [2019-11-06 21:19:40,683 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,684 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455366352] [2019-11-06 21:19:40,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,685 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,685 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2019-11-06 21:19:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,720 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2019-11-06 21:19:40,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-06 21:19:40,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,727 INFO L225 Difference]: With dead ends: 1980 [2019-11-06 21:19:40,727 INFO L226 Difference]: Without dead ends: 1162 [2019-11-06 21:19:40,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-11-06 21:19:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2019-11-06 21:19:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2019-11-06 21:19:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2019-11-06 21:19:40,785 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2019-11-06 21:19:40,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,786 INFO L462 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2019-11-06 21:19:40,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2019-11-06 21:19:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:40,788 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,788 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] [2019-11-06 21:19:40,788 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2019-11-06 21:19:40,789 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,789 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294273178] [2019-11-06 21:19:40,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,820 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-06 21:19:40,820 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294273178] [2019-11-06 21:19:40,820 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,821 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100276117] [2019-11-06 21:19:40,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,821 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,822 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2019-11-06 21:19:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,853 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2019-11-06 21:19:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:40,860 INFO L225 Difference]: With dead ends: 1740 [2019-11-06 21:19:40,860 INFO L226 Difference]: Without dead ends: 1178 [2019-11-06 21:19:40,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:40,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-06 21:19:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2019-11-06 21:19:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2019-11-06 21:19:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2019-11-06 21:19:40,898 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2019-11-06 21:19:40,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:40,899 INFO L462 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2019-11-06 21:19:40,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2019-11-06 21:19:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:40,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:40,902 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] [2019-11-06 21:19:40,902 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:40,902 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2019-11-06 21:19:40,903 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:40,903 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117005750] [2019-11-06 21:19:40,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:40,934 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-06 21:19:40,936 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117005750] [2019-11-06 21:19:40,936 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:40,936 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:40,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355769582] [2019-11-06 21:19:40,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:40,940 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:40,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:40,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:40,941 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2019-11-06 21:19:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:40,988 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2019-11-06 21:19:40,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:40,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:40,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:41,000 INFO L225 Difference]: With dead ends: 2124 [2019-11-06 21:19:41,001 INFO L226 Difference]: Without dead ends: 2122 [2019-11-06 21:19:41,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-11-06 21:19:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2019-11-06 21:19:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-11-06 21:19:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2019-11-06 21:19:41,062 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2019-11-06 21:19:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:41,063 INFO L462 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2019-11-06 21:19:41,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2019-11-06 21:19:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 21:19:41,066 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,066 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] [2019-11-06 21:19:41,067 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2019-11-06 21:19:41,067 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,067 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981988616] [2019-11-06 21:19:41,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,093 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-06 21:19:41,094 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981988616] [2019-11-06 21:19:41,094 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,094 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823253124] [2019-11-06 21:19:41,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,095 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,095 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2019-11-06 21:19:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:41,150 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2019-11-06 21:19:41,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:41,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-06 21:19:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:41,162 INFO L225 Difference]: With dead ends: 3916 [2019-11-06 21:19:41,162 INFO L226 Difference]: Without dead ends: 2282 [2019-11-06 21:19:41,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:41,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-11-06 21:19:41,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2019-11-06 21:19:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2019-11-06 21:19:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2019-11-06 21:19:41,233 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2019-11-06 21:19:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:41,233 INFO L462 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2019-11-06 21:19:41,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2019-11-06 21:19:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:41,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,237 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] [2019-11-06 21:19:41,237 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,238 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2019-11-06 21:19:41,238 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,239 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743056044] [2019-11-06 21:19:41,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,262 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-06 21:19:41,262 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743056044] [2019-11-06 21:19:41,262 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,262 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977034455] [2019-11-06 21:19:41,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,263 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,264 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2019-11-06 21:19:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:41,311 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2019-11-06 21:19:41,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:41,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:41,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:41,322 INFO L225 Difference]: With dead ends: 3420 [2019-11-06 21:19:41,323 INFO L226 Difference]: Without dead ends: 2314 [2019-11-06 21:19:41,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-11-06 21:19:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2019-11-06 21:19:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-11-06 21:19:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2019-11-06 21:19:41,411 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2019-11-06 21:19:41,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:41,411 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2019-11-06 21:19:41,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2019-11-06 21:19:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:41,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,414 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] [2019-11-06 21:19:41,415 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2019-11-06 21:19:41,415 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,415 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510841781] [2019-11-06 21:19:41,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,440 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-06 21:19:41,440 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510841781] [2019-11-06 21:19:41,441 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,441 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870895596] [2019-11-06 21:19:41,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,441 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,445 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2019-11-06 21:19:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:41,501 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2019-11-06 21:19:41,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:41,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:41,524 INFO L225 Difference]: With dead ends: 4108 [2019-11-06 21:19:41,524 INFO L226 Difference]: Without dead ends: 4106 [2019-11-06 21:19:41,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:41,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-11-06 21:19:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2019-11-06 21:19:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2019-11-06 21:19:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2019-11-06 21:19:41,643 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2019-11-06 21:19:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:41,644 INFO L462 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2019-11-06 21:19:41,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2019-11-06 21:19:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:19:41,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,650 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] [2019-11-06 21:19:41,650 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2019-11-06 21:19:41,650 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,651 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901206601] [2019-11-06 21:19:41,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,673 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-06 21:19:41,674 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901206601] [2019-11-06 21:19:41,674 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,674 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148632324] [2019-11-06 21:19:41,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,675 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,675 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2019-11-06 21:19:41,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:41,750 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2019-11-06 21:19:41,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:41,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-06 21:19:41,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:41,773 INFO L225 Difference]: With dead ends: 7756 [2019-11-06 21:19:41,773 INFO L226 Difference]: Without dead ends: 4490 [2019-11-06 21:19:41,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-11-06 21:19:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2019-11-06 21:19:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2019-11-06 21:19:41,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2019-11-06 21:19:41,938 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2019-11-06 21:19:41,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:41,938 INFO L462 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2019-11-06 21:19:41,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:41,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2019-11-06 21:19:41,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:41,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:41,944 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] [2019-11-06 21:19:41,945 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2019-11-06 21:19:41,946 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:41,946 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310976664] [2019-11-06 21:19:41,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:41,974 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-06 21:19:41,974 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310976664] [2019-11-06 21:19:41,974 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:41,975 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:41,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672256693] [2019-11-06 21:19:41,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:41,975 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:41,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:41,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:41,976 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2019-11-06 21:19:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:42,044 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2019-11-06 21:19:42,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:42,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:42,065 INFO L225 Difference]: With dead ends: 6732 [2019-11-06 21:19:42,065 INFO L226 Difference]: Without dead ends: 4554 [2019-11-06 21:19:42,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2019-11-06 21:19:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2019-11-06 21:19:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2019-11-06 21:19:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2019-11-06 21:19:42,188 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2019-11-06 21:19:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:42,188 INFO L462 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2019-11-06 21:19:42,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2019-11-06 21:19:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:42,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:42,195 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] [2019-11-06 21:19:42,195 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2019-11-06 21:19:42,196 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:42,196 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135282495] [2019-11-06 21:19:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:42,224 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-06 21:19:42,225 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135282495] [2019-11-06 21:19:42,225 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:42,225 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:42,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135095917] [2019-11-06 21:19:42,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:42,226 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:42,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:42,227 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2019-11-06 21:19:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:42,358 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2019-11-06 21:19:42,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:42,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:42,380 INFO L225 Difference]: With dead ends: 13260 [2019-11-06 21:19:42,380 INFO L226 Difference]: Without dead ends: 8842 [2019-11-06 21:19:42,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2019-11-06 21:19:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2019-11-06 21:19:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-11-06 21:19:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2019-11-06 21:19:42,691 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2019-11-06 21:19:42,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:42,691 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2019-11-06 21:19:42,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2019-11-06 21:19:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:19:42,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:42,702 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] [2019-11-06 21:19:42,703 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2019-11-06 21:19:42,703 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:42,704 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694068179] [2019-11-06 21:19:42,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:42,722 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-06 21:19:42,723 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694068179] [2019-11-06 21:19:42,723 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:42,723 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:42,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923672099] [2019-11-06 21:19:42,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:42,724 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:42,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:42,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:42,724 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2019-11-06 21:19:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:42,845 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2019-11-06 21:19:42,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:42,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 21:19:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:42,868 INFO L225 Difference]: With dead ends: 10124 [2019-11-06 21:19:42,868 INFO L226 Difference]: Without dead ends: 10122 [2019-11-06 21:19:42,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2019-11-06 21:19:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2019-11-06 21:19:43,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2019-11-06 21:19:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2019-11-06 21:19:43,143 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2019-11-06 21:19:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:43,144 INFO L462 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2019-11-06 21:19:43,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2019-11-06 21:19:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:43,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:43,154 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] [2019-11-06 21:19:43,155 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:43,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:43,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2019-11-06 21:19:43,155 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:43,155 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418200910] [2019-11-06 21:19:43,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:43,175 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-06 21:19:43,176 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418200910] [2019-11-06 21:19:43,176 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:43,176 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:43,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512274953] [2019-11-06 21:19:43,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:43,177 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:43,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:43,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:43,177 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2019-11-06 21:19:43,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:43,329 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2019-11-06 21:19:43,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:43,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:43,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:43,358 INFO L225 Difference]: With dead ends: 15244 [2019-11-06 21:19:43,359 INFO L226 Difference]: Without dead ends: 15242 [2019-11-06 21:19:43,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2019-11-06 21:19:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2019-11-06 21:19:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2019-11-06 21:19:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2019-11-06 21:19:43,737 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2019-11-06 21:19:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:43,737 INFO L462 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2019-11-06 21:19:43,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2019-11-06 21:19:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:19:43,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:43,756 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] [2019-11-06 21:19:43,757 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2019-11-06 21:19:43,757 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:43,757 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384573607] [2019-11-06 21:19:43,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:43,780 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-06 21:19:43,781 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384573607] [2019-11-06 21:19:43,781 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:43,781 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:43,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930812075] [2019-11-06 21:19:43,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:43,782 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:43,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:43,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:43,782 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2019-11-06 21:19:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:43,969 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2019-11-06 21:19:43,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:43,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-06 21:19:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:44,002 INFO L225 Difference]: With dead ends: 30348 [2019-11-06 21:19:44,002 INFO L226 Difference]: Without dead ends: 17290 [2019-11-06 21:19:44,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:44,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2019-11-06 21:19:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2019-11-06 21:19:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2019-11-06 21:19:44,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2019-11-06 21:19:44,828 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2019-11-06 21:19:44,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:44,829 INFO L462 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2019-11-06 21:19:44,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2019-11-06 21:19:44,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:44,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:44,850 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] [2019-11-06 21:19:44,850 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:44,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:44,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2019-11-06 21:19:44,851 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:44,851 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444540705] [2019-11-06 21:19:44,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:44,873 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-06 21:19:44,873 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444540705] [2019-11-06 21:19:44,874 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:44,874 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:44,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739669902] [2019-11-06 21:19:44,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:44,875 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:44,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:44,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:44,875 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2019-11-06 21:19:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:45,052 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2019-11-06 21:19:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:45,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:45,085 INFO L225 Difference]: With dead ends: 26124 [2019-11-06 21:19:45,085 INFO L226 Difference]: Without dead ends: 17674 [2019-11-06 21:19:45,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2019-11-06 21:19:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2019-11-06 21:19:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2019-11-06 21:19:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2019-11-06 21:19:45,503 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2019-11-06 21:19:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:45,504 INFO L462 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2019-11-06 21:19:45,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:45,504 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2019-11-06 21:19:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:45,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:45,528 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] [2019-11-06 21:19:45,528 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:45,530 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2019-11-06 21:19:45,530 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:45,530 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537982076] [2019-11-06 21:19:45,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:45,555 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-06 21:19:45,555 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537982076] [2019-11-06 21:19:45,556 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:45,556 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:45,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112737276] [2019-11-06 21:19:45,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:45,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:45,559 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2019-11-06 21:19:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:45,821 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2019-11-06 21:19:45,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:45,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:45,879 INFO L225 Difference]: With dead ends: 29708 [2019-11-06 21:19:45,879 INFO L226 Difference]: Without dead ends: 29706 [2019-11-06 21:19:45,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2019-11-06 21:19:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2019-11-06 21:19:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2019-11-06 21:19:46,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2019-11-06 21:19:46,465 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2019-11-06 21:19:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:46,466 INFO L462 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2019-11-06 21:19:46,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2019-11-06 21:19:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 21:19:46,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:46,503 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] [2019-11-06 21:19:46,503 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2019-11-06 21:19:46,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:46,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955468368] [2019-11-06 21:19:46,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:46,522 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-06 21:19:46,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955468368] [2019-11-06 21:19:46,523 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:46,523 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:46,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160395633] [2019-11-06 21:19:46,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:46,524 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:46,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:46,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:46,524 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2019-11-06 21:19:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:46,845 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2019-11-06 21:19:46,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:46,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-06 21:19:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:46,942 INFO L225 Difference]: With dead ends: 60428 [2019-11-06 21:19:46,943 INFO L226 Difference]: Without dead ends: 34314 [2019-11-06 21:19:47,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2019-11-06 21:19:48,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2019-11-06 21:19:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2019-11-06 21:19:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2019-11-06 21:19:48,234 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2019-11-06 21:19:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:48,234 INFO L462 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2019-11-06 21:19:48,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2019-11-06 21:19:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:19:48,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:48,256 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] [2019-11-06 21:19:48,256 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:48,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:48,256 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2019-11-06 21:19:48,257 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:48,257 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086225091] [2019-11-06 21:19:48,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:48,283 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-06 21:19:48,283 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086225091] [2019-11-06 21:19:48,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:48,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:48,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503243260] [2019-11-06 21:19:48,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:48,284 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:48,285 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2019-11-06 21:19:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:48,691 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2019-11-06 21:19:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:48,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-06 21:19:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:48,755 INFO L225 Difference]: With dead ends: 51468 [2019-11-06 21:19:48,755 INFO L226 Difference]: Without dead ends: 34826 [2019-11-06 21:19:48,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2019-11-06 21:19:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2019-11-06 21:19:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2019-11-06 21:19:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2019-11-06 21:19:49,332 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2019-11-06 21:19:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:49,333 INFO L462 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2019-11-06 21:19:49,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2019-11-06 21:19:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:19:49,354 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:49,354 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] [2019-11-06 21:19:49,355 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2019-11-06 21:19:49,355 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:49,355 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22715943] [2019-11-06 21:19:49,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:49,373 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-06 21:19:49,373 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22715943] [2019-11-06 21:19:49,373 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:49,373 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:49,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757598730] [2019-11-06 21:19:49,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:49,374 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:49,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:49,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:49,375 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2019-11-06 21:19:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:49,910 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2019-11-06 21:19:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:49,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-06 21:19:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:49,966 INFO L225 Difference]: With dead ends: 57356 [2019-11-06 21:19:49,966 INFO L226 Difference]: Without dead ends: 57354 [2019-11-06 21:19:49,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-11-06 21:19:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2019-11-06 21:19:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2019-11-06 21:19:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2019-11-06 21:19:50,774 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2019-11-06 21:19:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:50,774 INFO L462 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2019-11-06 21:19:50,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2019-11-06 21:19:50,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:19:50,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:50,808 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] [2019-11-06 21:19:50,808 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:50,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2019-11-06 21:19:50,808 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:50,808 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310292365] [2019-11-06 21:19:50,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:50,826 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-06 21:19:50,826 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310292365] [2019-11-06 21:19:50,826 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:50,826 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:50,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195258339] [2019-11-06 21:19:50,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:50,827 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:50,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:50,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:50,828 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2019-11-06 21:19:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:51,382 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2019-11-06 21:19:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:51,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-06 21:19:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:51,444 INFO L225 Difference]: With dead ends: 119820 [2019-11-06 21:19:51,444 INFO L226 Difference]: Without dead ends: 67594 [2019-11-06 21:19:51,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2019-11-06 21:19:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2019-11-06 21:19:53,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2019-11-06 21:19:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2019-11-06 21:19:53,436 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2019-11-06 21:19:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:53,436 INFO L462 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2019-11-06 21:19:53,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:53,436 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2019-11-06 21:19:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:19:53,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:53,473 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] [2019-11-06 21:19:53,473 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:53,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:53,474 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2019-11-06 21:19:53,474 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:53,474 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213491484] [2019-11-06 21:19:53,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:53,499 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-06 21:19:53,500 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213491484] [2019-11-06 21:19:53,500 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:53,500 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:53,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012195292] [2019-11-06 21:19:53,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:53,501 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:53,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:53,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:53,501 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2019-11-06 21:19:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:54,169 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2019-11-06 21:19:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:54,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 21:19:54,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:54,224 INFO L225 Difference]: With dead ends: 101388 [2019-11-06 21:19:54,224 INFO L226 Difference]: Without dead ends: 68618 [2019-11-06 21:19:54,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2019-11-06 21:19:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2019-11-06 21:19:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2019-11-06 21:19:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2019-11-06 21:19:56,645 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2019-11-06 21:19:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:56,646 INFO L462 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2019-11-06 21:19:56,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2019-11-06 21:19:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:19:56,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:56,669 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] [2019-11-06 21:19:56,669 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:56,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2019-11-06 21:19:56,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:56,670 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96456836] [2019-11-06 21:19:56,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:56,698 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-06 21:19:56,698 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96456836] [2019-11-06 21:19:56,698 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:56,699 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:56,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587086271] [2019-11-06 21:19:56,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:56,699 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:56,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:56,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:56,700 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2019-11-06 21:19:57,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:19:57,379 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2019-11-06 21:19:57,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:19:57,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 21:19:57,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:19:57,482 INFO L225 Difference]: With dead ends: 110602 [2019-11-06 21:19:57,482 INFO L226 Difference]: Without dead ends: 110600 [2019-11-06 21:19:57,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:19:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2019-11-06 21:19:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2019-11-06 21:19:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2019-11-06 21:19:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2019-11-06 21:19:58,768 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2019-11-06 21:19:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:19:58,768 INFO L462 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2019-11-06 21:19:58,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:19:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2019-11-06 21:19:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 21:19:58,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:19:58,820 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] [2019-11-06 21:19:58,820 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:19:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:19:58,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2019-11-06 21:19:58,820 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:19:58,820 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437677212] [2019-11-06 21:19:58,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:19:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:19:58,836 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-06 21:19:58,836 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437677212] [2019-11-06 21:19:58,837 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:19:58,837 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:19:58,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732993778] [2019-11-06 21:19:58,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:19:58,837 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:19:58,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:19:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:19:58,838 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2019-11-06 21:20:00,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:20:00,210 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2019-11-06 21:20:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:20:00,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-06 21:20:00,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:20:00,211 INFO L225 Difference]: With dead ends: 237576 [2019-11-06 21:20:00,211 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:20:00,344 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 21:20:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:20:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:20:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:20:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:20:00,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-06 21:20:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:20:00,345 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:20:00,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:20:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:20:00,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:20:00,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:20:00,382 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 21:20:00,382 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:00,382 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:20:00,382 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:20:00,382 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:20:00,382 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,383 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,384 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2019-11-06 21:20:00,384 INFO L446 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,385 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L446 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,386 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2019-11-06 21:20:00,387 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-11-06 21:20:00,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:20:00 BoogieIcfgContainer [2019-11-06 21:20:00,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:20:00,399 INFO L168 Benchmark]: Toolchain (without parser) took 22469.25 ms. Allocated memory was 139.5 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 104.4 MB in the beginning and 634.1 MB in the end (delta: -529.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-06 21:20:00,401 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 21:20:00,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.56 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 104.2 MB in the beginning and 181.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:00,402 INFO L168 Benchmark]: Boogie Preprocessor took 37.86 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 179.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:00,402 INFO L168 Benchmark]: RCFGBuilder took 418.46 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 158.4 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:20:00,405 INFO L168 Benchmark]: TraceAbstraction took 21602.14 ms. Allocated memory was 202.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 157.7 MB in the beginning and 634.1 MB in the end (delta: -476.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-11-06 21:20:00,408 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 400.56 ms. Allocated memory was 139.5 MB in the beginning and 202.4 MB in the end (delta: 62.9 MB). Free memory was 104.2 MB in the beginning and 181.3 MB in the end (delta: -77.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.86 ms. Allocated memory is still 202.4 MB. Free memory was 181.3 MB in the beginning and 179.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 418.46 ms. Allocated memory is still 202.4 MB. Free memory was 179.3 MB in the beginning and 158.4 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21602.14 ms. Allocated memory was 202.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 157.7 MB in the beginning and 634.1 MB in the end (delta: -476.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 1 error locations. Result: SAFE, OverallTime: 21.5s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106504occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...