/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:24:54,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:24:54,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:24:54,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:24:54,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:24:54,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:24:54,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:24:54,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:24:54,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:24:54,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:24:54,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:24:54,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:24:54,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:24:54,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:24:54,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:24:54,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:24:54,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:24:54,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:24:54,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:24:54,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:24:54,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:24:54,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:24:54,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:24:54,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:24:54,190 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:24:54,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:24:54,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:24:54,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:24:54,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:24:54,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:24:54,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:24:54,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:24:54,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:24:54,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:24:54,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:24:54,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:24:54,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:24:54,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:24:54,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:24:54,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:24:54,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:24:54,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:24:54,259 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:24:54,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:24:54,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:24:54,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:24:54,264 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:24:54,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:24:54,264 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:24:54,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:24:54,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:24:54,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:24:54,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:24:54,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:24:54,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:24:54,266 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:24:54,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:24:54,266 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:24:54,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:24:54,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:24:54,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:24:54,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:24:54,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:24:54,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:24:54,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:24:54,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:24:54,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:24:54,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:24:54,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:24:54,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:24:54,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:24:54,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:24:54,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:24:54,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:24:54,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:24:54,765 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:24:54,765 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:24:54,766 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2020-09-04 13:24:54,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d18fc793/b433b4ecbc754856b446b769f237ecf9/FLAGcde76486b [2020-09-04 13:24:55,397 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:24:55,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/locks/test_locks_11.c [2020-09-04 13:24:55,408 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d18fc793/b433b4ecbc754856b446b769f237ecf9/FLAGcde76486b [2020-09-04 13:24:55,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9d18fc793/b433b4ecbc754856b446b769f237ecf9 [2020-09-04 13:24:55,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:24:55,719 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:24:55,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:24:55,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:24:55,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:24:55,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8f57a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:55, skipping insertion in model container [2020-09-04 13:24:55,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:24:55" (1/1) ... [2020-09-04 13:24:55,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:24:55,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:24:56,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:24:56,028 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:24:56,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:24:56,073 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:24:56,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56 WrapperNode [2020-09-04 13:24:56,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:24:56,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:24:56,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:24:56,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:24:56,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... [2020-09-04 13:24:56,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:24:56,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:24:56,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:24:56,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:24:56,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-09-04 13:24:56,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:24:56,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:24:56,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:24:56,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:24:56,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:24:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:24:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:24:56,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:24:56,645 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:24:56,646 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-04 13:24:56,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:24:56 BoogieIcfgContainer [2020-09-04 13:24:56,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:24:56,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:24:56,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:24:56,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:24:56,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:24:55" (1/3) ... [2020-09-04 13:24:56,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1a9497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:24:56, skipping insertion in model container [2020-09-04 13:24:56,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:24:56" (2/3) ... [2020-09-04 13:24:56,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f1a9497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:24:56, skipping insertion in model container [2020-09-04 13:24:56,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:24:56" (3/3) ... [2020-09-04 13:24:56,663 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2020-09-04 13:24:56,678 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:24:56,689 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:24:56,716 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:24:56,772 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:24:56,773 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:24:56,773 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:24:56,773 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:24:56,773 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:24:56,774 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:24:56,774 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:24:56,774 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:24:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2020-09-04 13:24:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:24:56,806 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:56,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:24:56,808 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2020-09-04 13:24:56,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:56,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401925954] [2020-09-04 13:24:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401925954] [2020-09-04 13:24:57,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241698153] [2020-09-04 13:24:57,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,096 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2020-09-04 13:24:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,162 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-09-04 13:24:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:24:57,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,182 INFO L225 Difference]: With dead ends: 93 [2020-09-04 13:24:57,182 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 13:24:57,187 INFO L675 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 [2020-09-04 13:24:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 13:24:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2020-09-04 13:24:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 13:24:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2020-09-04 13:24:57,244 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2020-09-04 13:24:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,245 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2020-09-04 13:24:57,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2020-09-04 13:24:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-09-04 13:24:57,247 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:24:57,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:24:57,248 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2020-09-04 13:24:57,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315095994] [2020-09-04 13:24:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315095994] [2020-09-04 13:24:57,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549508543] [2020-09-04 13:24:57,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,332 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2020-09-04 13:24:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,375 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2020-09-04 13:24:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-09-04 13:24:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,380 INFO L225 Difference]: With dead ends: 127 [2020-09-04 13:24:57,380 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 13:24:57,382 INFO L675 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 [2020-09-04 13:24:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 13:24:57,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2020-09-04 13:24:57,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 13:24:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2020-09-04 13:24:57,404 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2020-09-04 13:24:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,405 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2020-09-04 13:24:57,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2020-09-04 13:24:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:24:57,407 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,407 INFO L422 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] [2020-09-04 13:24:57,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:24:57,408 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2020-09-04 13:24:57,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095451330] [2020-09-04 13:24:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,479 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095451330] [2020-09-04 13:24:57,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062805846] [2020-09-04 13:24:57,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,482 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2020-09-04 13:24:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,508 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2020-09-04 13:24:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:24:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,510 INFO L225 Difference]: With dead ends: 117 [2020-09-04 13:24:57,511 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 13:24:57,512 INFO L675 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 [2020-09-04 13:24:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 13:24:57,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-09-04 13:24:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 13:24:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2020-09-04 13:24:57,523 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2020-09-04 13:24:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,524 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2020-09-04 13:24:57,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2020-09-04 13:24:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:24:57,525 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,526 INFO L422 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] [2020-09-04 13:24:57,526 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 13:24:57,526 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2020-09-04 13:24:57,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065951313] [2020-09-04 13:24:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065951313] [2020-09-04 13:24:57,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286053622] [2020-09-04 13:24:57,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,581 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2020-09-04 13:24:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,632 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2020-09-04 13:24:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:24:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,635 INFO L225 Difference]: With dead ends: 148 [2020-09-04 13:24:57,635 INFO L226 Difference]: Without dead ends: 146 [2020-09-04 13:24:57,639 INFO L675 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 [2020-09-04 13:24:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-09-04 13:24:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2020-09-04 13:24:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-09-04 13:24:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2020-09-04 13:24:57,663 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2020-09-04 13:24:57,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,664 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2020-09-04 13:24:57,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,664 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2020-09-04 13:24:57,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-09-04 13:24:57,666 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,666 INFO L422 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] [2020-09-04 13:24:57,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 13:24:57,667 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,667 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2020-09-04 13:24:57,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117527080] [2020-09-04 13:24:57,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117527080] [2020-09-04 13:24:57,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021179166] [2020-09-04 13:24:57,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,730 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2020-09-04 13:24:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,754 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2020-09-04 13:24:57,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-09-04 13:24:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,757 INFO L225 Difference]: With dead ends: 244 [2020-09-04 13:24:57,757 INFO L226 Difference]: Without dead ends: 148 [2020-09-04 13:24:57,758 INFO L675 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 [2020-09-04 13:24:57,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-09-04 13:24:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2020-09-04 13:24:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-09-04 13:24:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2020-09-04 13:24:57,772 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2020-09-04 13:24:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,773 INFO L479 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2020-09-04 13:24:57,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2020-09-04 13:24:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:24:57,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,775 INFO L422 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] [2020-09-04 13:24:57,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 13:24:57,776 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2020-09-04 13:24:57,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211715290] [2020-09-04 13:24:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211715290] [2020-09-04 13:24:57,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366702720] [2020-09-04 13:24:57,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,850 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2020-09-04 13:24:57,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,891 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2020-09-04 13:24:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:24:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,893 INFO L225 Difference]: With dead ends: 219 [2020-09-04 13:24:57,893 INFO L226 Difference]: Without dead ends: 150 [2020-09-04 13:24:57,894 INFO L675 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 [2020-09-04 13:24:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-09-04 13:24:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2020-09-04 13:24:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-09-04 13:24:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2020-09-04 13:24:57,912 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2020-09-04 13:24:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,912 INFO L479 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2020-09-04 13:24:57,912 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2020-09-04 13:24:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:24:57,914 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:57,914 INFO L422 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] [2020-09-04 13:24:57,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 13:24:57,915 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:57,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:57,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2020-09-04 13:24:57,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:57,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447946849] [2020-09-04 13:24:57,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:57,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:57,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447946849] [2020-09-04 13:24:57,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:57,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:57,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240766855] [2020-09-04 13:24:57,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:57,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:57,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:57,958 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2020-09-04 13:24:57,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:57,978 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2020-09-04 13:24:57,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:57,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:24:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:57,981 INFO L225 Difference]: With dead ends: 276 [2020-09-04 13:24:57,981 INFO L226 Difference]: Without dead ends: 274 [2020-09-04 13:24:57,982 INFO L675 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 [2020-09-04 13:24:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2020-09-04 13:24:57,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2020-09-04 13:24:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-09-04 13:24:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2020-09-04 13:24:57,997 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2020-09-04 13:24:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:57,997 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2020-09-04 13:24:57,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2020-09-04 13:24:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 13:24:58,001 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,001 INFO L422 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] [2020-09-04 13:24:58,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 13:24:58,002 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2020-09-04 13:24:58,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333620275] [2020-09-04 13:24:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,098 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333620275] [2020-09-04 13:24:58,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274419281] [2020-09-04 13:24:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,105 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2020-09-04 13:24:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,166 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2020-09-04 13:24:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-09-04 13:24:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,172 INFO L225 Difference]: With dead ends: 472 [2020-09-04 13:24:58,172 INFO L226 Difference]: Without dead ends: 282 [2020-09-04 13:24:58,174 INFO L675 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 [2020-09-04 13:24:58,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-09-04 13:24:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2020-09-04 13:24:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-09-04 13:24:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2020-09-04 13:24:58,214 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2020-09-04 13:24:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,214 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2020-09-04 13:24:58,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2020-09-04 13:24:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:24:58,217 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,219 INFO L422 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] [2020-09-04 13:24:58,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 13:24:58,219 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2020-09-04 13:24:58,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077298305] [2020-09-04 13:24:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077298305] [2020-09-04 13:24:58,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639852551] [2020-09-04 13:24:58,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,284 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2020-09-04 13:24:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,314 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2020-09-04 13:24:58,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:24:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,318 INFO L225 Difference]: With dead ends: 420 [2020-09-04 13:24:58,318 INFO L226 Difference]: Without dead ends: 286 [2020-09-04 13:24:58,319 INFO L675 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 [2020-09-04 13:24:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-09-04 13:24:58,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2020-09-04 13:24:58,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-09-04 13:24:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2020-09-04 13:24:58,336 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2020-09-04 13:24:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,338 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2020-09-04 13:24:58,339 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2020-09-04 13:24:58,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:24:58,346 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,347 INFO L422 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] [2020-09-04 13:24:58,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 13:24:58,351 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,351 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2020-09-04 13:24:58,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132560987] [2020-09-04 13:24:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132560987] [2020-09-04 13:24:58,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634652944] [2020-09-04 13:24:58,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,417 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2020-09-04 13:24:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,451 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2020-09-04 13:24:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:24:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,460 INFO L225 Difference]: With dead ends: 524 [2020-09-04 13:24:58,461 INFO L226 Difference]: Without dead ends: 522 [2020-09-04 13:24:58,461 INFO L675 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 [2020-09-04 13:24:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-09-04 13:24:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2020-09-04 13:24:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-09-04 13:24:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2020-09-04 13:24:58,486 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2020-09-04 13:24:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,487 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2020-09-04 13:24:58,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2020-09-04 13:24:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 13:24:58,488 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,489 INFO L422 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] [2020-09-04 13:24:58,489 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 13:24:58,489 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2020-09-04 13:24:58,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997984051] [2020-09-04 13:24:58,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997984051] [2020-09-04 13:24:58,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45417726] [2020-09-04 13:24:58,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,543 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2020-09-04 13:24:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,585 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2020-09-04 13:24:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-09-04 13:24:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,590 INFO L225 Difference]: With dead ends: 924 [2020-09-04 13:24:58,590 INFO L226 Difference]: Without dead ends: 546 [2020-09-04 13:24:58,592 INFO L675 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 [2020-09-04 13:24:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-09-04 13:24:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2020-09-04 13:24:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-04 13:24:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2020-09-04 13:24:58,613 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2020-09-04 13:24:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,613 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2020-09-04 13:24:58,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2020-09-04 13:24:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:24:58,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,617 INFO L422 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] [2020-09-04 13:24:58,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 13:24:58,617 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,618 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2020-09-04 13:24:58,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275032898] [2020-09-04 13:24:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,649 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275032898] [2020-09-04 13:24:58,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806925062] [2020-09-04 13:24:58,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,651 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2020-09-04 13:24:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,671 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2020-09-04 13:24:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:24:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,675 INFO L225 Difference]: With dead ends: 816 [2020-09-04 13:24:58,675 INFO L226 Difference]: Without dead ends: 554 [2020-09-04 13:24:58,676 INFO L675 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 [2020-09-04 13:24:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-09-04 13:24:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2020-09-04 13:24:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-09-04 13:24:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2020-09-04 13:24:58,694 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2020-09-04 13:24:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,694 INFO L479 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2020-09-04 13:24:58,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2020-09-04 13:24:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:24:58,696 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,696 INFO L422 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] [2020-09-04 13:24:58,696 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:24:58,696 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2020-09-04 13:24:58,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457659342] [2020-09-04 13:24:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457659342] [2020-09-04 13:24:58,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368265356] [2020-09-04 13:24:58,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,734 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2020-09-04 13:24:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,769 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2020-09-04 13:24:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:24:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,776 INFO L225 Difference]: With dead ends: 1004 [2020-09-04 13:24:58,777 INFO L226 Difference]: Without dead ends: 1002 [2020-09-04 13:24:58,778 INFO L675 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 [2020-09-04 13:24:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2020-09-04 13:24:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2020-09-04 13:24:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-09-04 13:24:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2020-09-04 13:24:58,807 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2020-09-04 13:24:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,808 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2020-09-04 13:24:58,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2020-09-04 13:24:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-09-04 13:24:58,810 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,810 INFO L422 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] [2020-09-04 13:24:58,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:24:58,811 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2020-09-04 13:24:58,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310647280] [2020-09-04 13:24:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310647280] [2020-09-04 13:24:58,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890987784] [2020-09-04 13:24:58,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,859 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2020-09-04 13:24:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:58,905 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2020-09-04 13:24:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:58,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-09-04 13:24:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:58,910 INFO L225 Difference]: With dead ends: 1820 [2020-09-04 13:24:58,910 INFO L226 Difference]: Without dead ends: 1066 [2020-09-04 13:24:58,912 INFO L675 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 [2020-09-04 13:24:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2020-09-04 13:24:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2020-09-04 13:24:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2020-09-04 13:24:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2020-09-04 13:24:58,942 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2020-09-04 13:24:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:58,942 INFO L479 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2020-09-04 13:24:58,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2020-09-04 13:24:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:24:58,944 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:58,944 INFO L422 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] [2020-09-04 13:24:58,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 13:24:58,945 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2020-09-04 13:24:58,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:58,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880935458] [2020-09-04 13:24:58,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:58,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880935458] [2020-09-04 13:24:58,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:58,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:58,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112231425] [2020-09-04 13:24:58,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:58,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:58,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:58,974 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2020-09-04 13:24:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,003 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2020-09-04 13:24:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:24:59,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,009 INFO L225 Difference]: With dead ends: 1596 [2020-09-04 13:24:59,009 INFO L226 Difference]: Without dead ends: 1082 [2020-09-04 13:24:59,011 INFO L675 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 [2020-09-04 13:24:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2020-09-04 13:24:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2020-09-04 13:24:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2020-09-04 13:24:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2020-09-04 13:24:59,045 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2020-09-04 13:24:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,045 INFO L479 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2020-09-04 13:24:59,046 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2020-09-04 13:24:59,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:24:59,047 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,048 INFO L422 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] [2020-09-04 13:24:59,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 13:24:59,048 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2020-09-04 13:24:59,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459264321] [2020-09-04 13:24:59,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:59,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459264321] [2020-09-04 13:24:59,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116562164] [2020-09-04 13:24:59,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,077 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2020-09-04 13:24:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,113 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2020-09-04 13:24:59,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:24:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,124 INFO L225 Difference]: With dead ends: 1932 [2020-09-04 13:24:59,124 INFO L226 Difference]: Without dead ends: 1930 [2020-09-04 13:24:59,125 INFO L675 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 [2020-09-04 13:24:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2020-09-04 13:24:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2020-09-04 13:24:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2020-09-04 13:24:59,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2020-09-04 13:24:59,177 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2020-09-04 13:24:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,177 INFO L479 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2020-09-04 13:24:59,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2020-09-04 13:24:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:24:59,181 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,181 INFO L422 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] [2020-09-04 13:24:59,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 13:24:59,182 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2020-09-04 13:24:59,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553138461] [2020-09-04 13:24:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:59,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553138461] [2020-09-04 13:24:59,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538475860] [2020-09-04 13:24:59,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,218 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2020-09-04 13:24:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,276 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2020-09-04 13:24:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-09-04 13:24:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,291 INFO L225 Difference]: With dead ends: 3596 [2020-09-04 13:24:59,292 INFO L226 Difference]: Without dead ends: 2090 [2020-09-04 13:24:59,296 INFO L675 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 [2020-09-04 13:24:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-09-04 13:24:59,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2020-09-04 13:24:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2020-09-04 13:24:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2020-09-04 13:24:59,388 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2020-09-04 13:24:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,388 INFO L479 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2020-09-04 13:24:59,388 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2020-09-04 13:24:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:24:59,393 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,393 INFO L422 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] [2020-09-04 13:24:59,393 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 13:24:59,393 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2020-09-04 13:24:59,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138352853] [2020-09-04 13:24:59,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:59,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138352853] [2020-09-04 13:24:59,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640474045] [2020-09-04 13:24:59,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,424 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2020-09-04 13:24:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,522 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2020-09-04 13:24:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:24:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,536 INFO L225 Difference]: With dead ends: 3132 [2020-09-04 13:24:59,536 INFO L226 Difference]: Without dead ends: 2122 [2020-09-04 13:24:59,540 INFO L675 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 [2020-09-04 13:24:59,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-09-04 13:24:59,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2020-09-04 13:24:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2020-09-04 13:24:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2020-09-04 13:24:59,615 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2020-09-04 13:24:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,615 INFO L479 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2020-09-04 13:24:59,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2020-09-04 13:24:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:24:59,618 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,618 INFO L422 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] [2020-09-04 13:24:59,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 13:24:59,619 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2020-09-04 13:24:59,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642412273] [2020-09-04 13:24:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:59,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642412273] [2020-09-04 13:24:59,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958417752] [2020-09-04 13:24:59,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,647 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2020-09-04 13:24:59,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,708 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2020-09-04 13:24:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:24:59,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,726 INFO L225 Difference]: With dead ends: 3724 [2020-09-04 13:24:59,726 INFO L226 Difference]: Without dead ends: 3722 [2020-09-04 13:24:59,728 INFO L675 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 [2020-09-04 13:24:59,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2020-09-04 13:24:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2020-09-04 13:24:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2020-09-04 13:24:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2020-09-04 13:24:59,813 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2020-09-04 13:24:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:24:59,813 INFO L479 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2020-09-04 13:24:59,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:24:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2020-09-04 13:24:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:24:59,820 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:24:59,821 INFO L422 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] [2020-09-04 13:24:59,821 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 13:24:59,821 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:24:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:24:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2020-09-04 13:24:59,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:24:59,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086592292] [2020-09-04 13:24:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:24:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:24:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:24:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:24:59,857 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086592292] [2020-09-04 13:24:59,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:24:59,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:24:59,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153431358] [2020-09-04 13:24:59,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:24:59,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:24:59,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:24:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:24:59,859 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2020-09-04 13:24:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:24:59,926 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2020-09-04 13:24:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:24:59,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-09-04 13:24:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:24:59,945 INFO L225 Difference]: With dead ends: 7116 [2020-09-04 13:24:59,945 INFO L226 Difference]: Without dead ends: 4106 [2020-09-04 13:24:59,952 INFO L675 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 [2020-09-04 13:24:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2020-09-04 13:25:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2020-09-04 13:25:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2020-09-04 13:25:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2020-09-04 13:25:00,090 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2020-09-04 13:25:00,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:00,091 INFO L479 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2020-09-04 13:25:00,091 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2020-09-04 13:25:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:00,096 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:00,096 INFO L422 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] [2020-09-04 13:25:00,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 13:25:00,101 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:00,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2020-09-04 13:25:00,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:00,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327807563] [2020-09-04 13:25:00,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:00,134 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327807563] [2020-09-04 13:25:00,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:00,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:00,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721361694] [2020-09-04 13:25:00,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:00,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:00,138 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2020-09-04 13:25:00,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:00,206 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2020-09-04 13:25:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:00,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-09-04 13:25:00,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:00,246 INFO L225 Difference]: With dead ends: 6156 [2020-09-04 13:25:00,246 INFO L226 Difference]: Without dead ends: 4170 [2020-09-04 13:25:00,251 INFO L675 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 [2020-09-04 13:25:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2020-09-04 13:25:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2020-09-04 13:25:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2020-09-04 13:25:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2020-09-04 13:25:00,369 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2020-09-04 13:25:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:00,369 INFO L479 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2020-09-04 13:25:00,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2020-09-04 13:25:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:00,374 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:00,375 INFO L422 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] [2020-09-04 13:25:00,375 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 13:25:00,375 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2020-09-04 13:25:00,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:00,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444698637] [2020-09-04 13:25:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:00,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444698637] [2020-09-04 13:25:00,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:00,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:00,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6021713] [2020-09-04 13:25:00,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:00,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:00,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:00,403 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2020-09-04 13:25:00,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:00,527 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2020-09-04 13:25:00,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:00,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-09-04 13:25:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:00,546 INFO L225 Difference]: With dead ends: 12108 [2020-09-04 13:25:00,547 INFO L226 Difference]: Without dead ends: 8074 [2020-09-04 13:25:00,558 INFO L675 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 [2020-09-04 13:25:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2020-09-04 13:25:00,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2020-09-04 13:25:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-09-04 13:25:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2020-09-04 13:25:00,788 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2020-09-04 13:25:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:00,788 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2020-09-04 13:25:00,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2020-09-04 13:25:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-09-04 13:25:00,797 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:00,797 INFO L422 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] [2020-09-04 13:25:00,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 13:25:00,797 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:00,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2020-09-04 13:25:00,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:00,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495516496] [2020-09-04 13:25:00,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:00,825 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495516496] [2020-09-04 13:25:00,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:00,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:00,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517152788] [2020-09-04 13:25:00,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:00,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:00,827 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2020-09-04 13:25:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:00,950 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2020-09-04 13:25:00,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:00,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-09-04 13:25:00,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:00,976 INFO L225 Difference]: With dead ends: 9100 [2020-09-04 13:25:00,976 INFO L226 Difference]: Without dead ends: 9098 [2020-09-04 13:25:00,981 INFO L675 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 [2020-09-04 13:25:00,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2020-09-04 13:25:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2020-09-04 13:25:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2020-09-04 13:25:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2020-09-04 13:25:01,318 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2020-09-04 13:25:01,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:01,319 INFO L479 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2020-09-04 13:25:01,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2020-09-04 13:25:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 13:25:01,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:01,330 INFO L422 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] [2020-09-04 13:25:01,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 13:25:01,331 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2020-09-04 13:25:01,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:01,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337083314] [2020-09-04 13:25:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:01,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:01,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337083314] [2020-09-04 13:25:01,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:01,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:01,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346190933] [2020-09-04 13:25:01,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:01,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:01,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:01,361 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2020-09-04 13:25:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:01,596 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2020-09-04 13:25:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:01,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-09-04 13:25:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:01,623 INFO L225 Difference]: With dead ends: 13708 [2020-09-04 13:25:01,623 INFO L226 Difference]: Without dead ends: 13706 [2020-09-04 13:25:01,628 INFO L675 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 [2020-09-04 13:25:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2020-09-04 13:25:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2020-09-04 13:25:01,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2020-09-04 13:25:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2020-09-04 13:25:01,986 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2020-09-04 13:25:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:01,986 INFO L479 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2020-09-04 13:25:01,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2020-09-04 13:25:02,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-09-04 13:25:02,003 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:02,003 INFO L422 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] [2020-09-04 13:25:02,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 13:25:02,004 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:02,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:02,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2020-09-04 13:25:02,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:02,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850343807] [2020-09-04 13:25:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:02,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:02,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850343807] [2020-09-04 13:25:02,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:02,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:02,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055679723] [2020-09-04 13:25:02,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:02,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:02,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:02,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:02,030 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2020-09-04 13:25:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:02,248 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2020-09-04 13:25:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:02,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-09-04 13:25:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:02,278 INFO L225 Difference]: With dead ends: 27788 [2020-09-04 13:25:02,278 INFO L226 Difference]: Without dead ends: 15754 [2020-09-04 13:25:02,302 INFO L675 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 [2020-09-04 13:25:02,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2020-09-04 13:25:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2020-09-04 13:25:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2020-09-04 13:25:02,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2020-09-04 13:25:02,806 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2020-09-04 13:25:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:02,807 INFO L479 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2020-09-04 13:25:02,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2020-09-04 13:25:02,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:25:02,824 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:02,825 INFO L422 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] [2020-09-04 13:25:02,825 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 13:25:02,825 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:02,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2020-09-04 13:25:02,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:02,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174052947] [2020-09-04 13:25:02,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:02,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:02,856 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174052947] [2020-09-04 13:25:02,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:02,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:02,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446677225] [2020-09-04 13:25:02,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:02,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:02,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:02,858 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2020-09-04 13:25:03,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:03,037 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2020-09-04 13:25:03,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:03,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-09-04 13:25:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:03,070 INFO L225 Difference]: With dead ends: 23820 [2020-09-04 13:25:03,070 INFO L226 Difference]: Without dead ends: 16138 [2020-09-04 13:25:03,090 INFO L675 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 [2020-09-04 13:25:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2020-09-04 13:25:03,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2020-09-04 13:25:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2020-09-04 13:25:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2020-09-04 13:25:04,003 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2020-09-04 13:25:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:04,003 INFO L479 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2020-09-04 13:25:04,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:04,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2020-09-04 13:25:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:25:04,022 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:04,022 INFO L422 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] [2020-09-04 13:25:04,022 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 13:25:04,023 INFO L427 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2020-09-04 13:25:04,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:04,023 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925375610] [2020-09-04 13:25:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:04,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:04,046 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925375610] [2020-09-04 13:25:04,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:04,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:04,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249859797] [2020-09-04 13:25:04,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:04,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:04,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:04,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:04,048 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2020-09-04 13:25:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:04,304 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2020-09-04 13:25:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:04,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-09-04 13:25:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:04,348 INFO L225 Difference]: With dead ends: 26636 [2020-09-04 13:25:04,349 INFO L226 Difference]: Without dead ends: 26634 [2020-09-04 13:25:04,359 INFO L675 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 [2020-09-04 13:25:04,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2020-09-04 13:25:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2020-09-04 13:25:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2020-09-04 13:25:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2020-09-04 13:25:04,838 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2020-09-04 13:25:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:04,838 INFO L479 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2020-09-04 13:25:04,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2020-09-04 13:25:04,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 13:25:04,872 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:04,873 INFO L422 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] [2020-09-04 13:25:04,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-09-04 13:25:04,873 INFO L427 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:04,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2020-09-04 13:25:04,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:04,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5509839] [2020-09-04 13:25:04,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:04,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:04,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5509839] [2020-09-04 13:25:04,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:04,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:04,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124982533] [2020-09-04 13:25:04,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:04,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:04,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:04,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:04,901 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2020-09-04 13:25:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:05,241 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2020-09-04 13:25:05,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:05,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-09-04 13:25:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:05,309 INFO L225 Difference]: With dead ends: 55308 [2020-09-04 13:25:05,309 INFO L226 Difference]: Without dead ends: 31242 [2020-09-04 13:25:05,372 INFO L675 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 [2020-09-04 13:25:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2020-09-04 13:25:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2020-09-04 13:25:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2020-09-04 13:25:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2020-09-04 13:25:06,305 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2020-09-04 13:25:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:06,305 INFO L479 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2020-09-04 13:25:06,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2020-09-04 13:25:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:25:06,334 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:06,334 INFO L422 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] [2020-09-04 13:25:06,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-09-04 13:25:06,334 INFO L427 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2020-09-04 13:25:06,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:06,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409186535] [2020-09-04 13:25:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:06,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:06,372 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409186535] [2020-09-04 13:25:06,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:06,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:06,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730692538] [2020-09-04 13:25:06,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:06,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:06,374 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2020-09-04 13:25:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:06,687 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2020-09-04 13:25:06,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:06,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-09-04 13:25:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:06,748 INFO L225 Difference]: With dead ends: 46860 [2020-09-04 13:25:06,748 INFO L226 Difference]: Without dead ends: 31754 [2020-09-04 13:25:07,031 INFO L675 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 [2020-09-04 13:25:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2020-09-04 13:25:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2020-09-04 13:25:07,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2020-09-04 13:25:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2020-09-04 13:25:07,573 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2020-09-04 13:25:07,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:07,574 INFO L479 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2020-09-04 13:25:07,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2020-09-04 13:25:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:25:07,593 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:07,593 INFO L422 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] [2020-09-04 13:25:07,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-09-04 13:25:07,594 INFO L427 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2020-09-04 13:25:07,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:07,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380632813] [2020-09-04 13:25:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:07,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:07,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380632813] [2020-09-04 13:25:07,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:07,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:07,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789047997] [2020-09-04 13:25:07,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:07,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:07,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:07,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:07,627 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2020-09-04 13:25:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:08,887 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2020-09-04 13:25:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:08,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-09-04 13:25:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:08,960 INFO L225 Difference]: With dead ends: 51210 [2020-09-04 13:25:08,960 INFO L226 Difference]: Without dead ends: 51208 [2020-09-04 13:25:08,976 INFO L675 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 [2020-09-04 13:25:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2020-09-04 13:25:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2020-09-04 13:25:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2020-09-04 13:25:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2020-09-04 13:25:09,732 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2020-09-04 13:25:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:09,733 INFO L479 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2020-09-04 13:25:09,733 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2020-09-04 13:25:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-09-04 13:25:09,775 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:25:09,776 INFO L422 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] [2020-09-04 13:25:09,776 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-09-04 13:25:09,776 INFO L427 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:25:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:25:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2020-09-04 13:25:09,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:25:09,777 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305659707] [2020-09-04 13:25:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:25:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:25:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:25:09,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:25:09,800 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305659707] [2020-09-04 13:25:09,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:25:09,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-09-04 13:25:09,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653691347] [2020-09-04 13:25:09,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-09-04 13:25:09,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:25:09,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-09-04 13:25:09,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-09-04 13:25:09,802 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2020-09-04 13:25:10,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:25:10,804 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2020-09-04 13:25:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-09-04 13:25:10,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2020-09-04 13:25:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:25:10,806 INFO L225 Difference]: With dead ends: 109576 [2020-09-04 13:25:10,806 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 13:25:10,895 INFO L675 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 [2020-09-04 13:25:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 13:25:10,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 13:25:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 13:25:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 13:25:10,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-09-04 13:25:10,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:25:10,896 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 13:25:10,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-09-04 13:25:10,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 13:25:10,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 13:25:10,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-09-04 13:25:10,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 13:25:10,927 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 13:25:10,927 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:10,927 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-09-04 13:25:10,927 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 13:25:10,927 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 13:25:10,927 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-09-04 13:25:10,927 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L118(line 118) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L44(lines 44 46) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L264 CegarLoopResult]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,928 INFO L268 CegarLoopResult]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2020-09-04 13:25:10,929 INFO L268 CegarLoopResult]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,930 INFO L268 CegarLoopResult]: For program point L71(lines 71 73) no Hoare annotation was computed. [2020-09-04 13:25:10,930 INFO L268 CegarLoopResult]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,930 INFO L268 CegarLoopResult]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,930 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-09-04 13:25:10,930 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2020-09-04 13:25:10,930 INFO L268 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L163(line 163) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L148(line 148) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L271 CegarLoopResult]: At program point L173(lines 5 177) the Hoare annotation is: true [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,931 INFO L268 CegarLoopResult]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L133(line 133) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,932 INFO L268 CegarLoopResult]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2020-09-04 13:25:10,933 INFO L271 CegarLoopResult]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2020-09-04 13:25:10,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:25:10 BoogieIcfgContainer [2020-09-04 13:25:10,946 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:25:10,949 INFO L168 Benchmark]: Toolchain (without parser) took 15230.21 ms. Allocated memory was 142.6 MB in the beginning and 1.1 GB in the end (delta: 953.2 MB). Free memory was 105.5 MB in the beginning and 606.4 MB in the end (delta: -500.9 MB). Peak memory consumption was 452.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:10,950 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 13:25:10,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.55 ms. Allocated memory is still 142.6 MB. Free memory was 105.5 MB in the beginning and 94.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:10,951 INFO L168 Benchmark]: Boogie Preprocessor took 126.84 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 94.6 MB in the beginning and 182.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:10,951 INFO L168 Benchmark]: RCFGBuilder took 450.53 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 162.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:10,952 INFO L168 Benchmark]: TraceAbstraction took 14292.22 ms. Allocated memory was 204.5 MB in the beginning and 1.1 GB in the end (delta: 891.3 MB). Free memory was 161.2 MB in the beginning and 606.4 MB in the end (delta: -445.2 MB). Peak memory consumption was 446.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:25:10,954 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 142.6 MB. Free memory was 124.1 MB in the beginning and 123.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.55 ms. Allocated memory is still 142.6 MB. Free memory was 105.5 MB in the beginning and 94.6 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 126.84 ms. Allocated memory was 142.6 MB in the beginning and 204.5 MB in the end (delta: 61.9 MB). Free memory was 94.6 MB in the beginning and 182.1 MB in the end (delta: -87.5 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 450.53 ms. Allocated memory is still 204.5 MB. Free memory was 182.1 MB in the beginning and 162.1 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14292.22 ms. Allocated memory was 204.5 MB in the beginning and 1.1 GB in the end (delta: 891.3 MB). Free memory was 161.2 MB in the beginning and 606.4 MB in the end (delta: -445.2 MB). Peak memory consumption was 446.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.1s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.9s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...