/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.2.0-7d8eed3 [2020-11-06 22:26:21,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:26:21,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:26:21,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:26:21,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:26:21,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:26:21,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:26:21,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:26:21,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:26:21,685 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:26:21,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:26:21,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:26:21,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:26:21,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:26:21,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:26:21,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:26:21,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:26:21,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:26:21,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:26:21,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:26:21,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:26:21,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:26:21,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:26:21,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:26:21,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:26:21,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:26:21,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:26:21,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:26:21,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:26:21,753 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:26:21,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:26:21,754 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:26:21,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:26:21,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:26:21,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:26:21,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:26:21,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:26:21,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:26:21,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:26:21,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:26:21,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:26:21,765 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:26:21,797 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:26:21,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:26:21,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:26:21,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:26:21,801 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:26:21,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:26:21,801 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:26:21,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:26:21,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:26:21,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:26:21,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:26:21,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:26:21,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:26:21,803 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:26:21,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:26:21,803 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:26:21,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:26:21,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:26:21,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:26:21,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:26:21,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:26:21,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:26:21,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:26:21,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:26:21,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:26:21,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:26:21,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:26:21,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:26:21,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:26:21,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:26:22,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:26:22,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:26:22,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:26:22,295 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:26:22,296 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:26:22,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2020-11-06 22:26:22,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b761706d4/23353984884243709c83c429e9463b70/FLAG2a43da963 [2020-11-06 22:26:23,449 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:26:23,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2020-11-06 22:26:23,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b761706d4/23353984884243709c83c429e9463b70/FLAG2a43da963 [2020-11-06 22:26:23,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b761706d4/23353984884243709c83c429e9463b70 [2020-11-06 22:26:23,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:26:23,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:26:23,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:26:23,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:26:23,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:26:23,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:23" (1/1) ... [2020-11-06 22:26:23,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b10590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:23, skipping insertion in model container [2020-11-06 22:26:23,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:26:23" (1/1) ... [2020-11-06 22:26:23,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:26:23,796 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:26:24,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:26:24,018 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:26:24,057 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:26:24,088 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:26:24,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24 WrapperNode [2020-11-06 22:26:24,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:26:24,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:26:24,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:26:24,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:26:24,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... [2020-11-06 22:26:24,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:26:24,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:26:24,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:26:24,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:26:24,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:26:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:26:24,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:26:24,338 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:26:24,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:26:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:26:24,338 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:26:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:26:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:26:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:26:24,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:26:25,131 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:26:25,131 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-06 22:26:25,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:25 BoogieIcfgContainer [2020-11-06 22:26:25,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:26:25,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:26:25,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:26:25,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:26:25,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:26:23" (1/3) ... [2020-11-06 22:26:25,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715c8359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:25, skipping insertion in model container [2020-11-06 22:26:25,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:26:24" (2/3) ... [2020-11-06 22:26:25,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715c8359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:26:25, skipping insertion in model container [2020-11-06 22:26:25,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:26:25" (3/3) ... [2020-11-06 22:26:25,147 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2020-11-06 22:26:25,168 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:26:25,174 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:26:25,211 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:26:25,260 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:26:25,261 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:26:25,261 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:26:25,261 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:26:25,261 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:26:25,262 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:26:25,262 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:26:25,262 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:26:25,291 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-11-06 22:26:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:25,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:25,305 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-11-06 22:26:25,306 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2059309882, now seen corresponding path program 1 times [2020-11-06 22:26:25,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:25,335 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818076854] [2020-11-06 22:26:25,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:25,835 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-06 22:26:25,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:25,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818076854] [2020-11-06 22:26:25,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:25,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:25,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071223573] [2020-11-06 22:26:25,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:25,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:25,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:25,965 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 4 states. [2020-11-06 22:26:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:26,473 INFO L93 Difference]: Finished difference Result 98 states and 169 transitions. [2020-11-06 22:26:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:26,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:26,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:26,493 INFO L225 Difference]: With dead ends: 98 [2020-11-06 22:26:26,493 INFO L226 Difference]: Without dead ends: 79 [2020-11-06 22:26:26,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-06 22:26:26,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2020-11-06 22:26:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-06 22:26:26,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 99 transitions. [2020-11-06 22:26:26,565 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 99 transitions. Word has length 23 [2020-11-06 22:26:26,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:26,566 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 99 transitions. [2020-11-06 22:26:26,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 99 transitions. [2020-11-06 22:26:26,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-06 22:26:26,568 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:26,568 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-11-06 22:26:26,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:26:26,569 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:26,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:26,570 INFO L82 PathProgramCache]: Analyzing trace with hash 955793736, now seen corresponding path program 1 times [2020-11-06 22:26:26,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:26,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417882651] [2020-11-06 22:26:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:26,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:26,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417882651] [2020-11-06 22:26:26,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:26,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:26,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373892512] [2020-11-06 22:26:26,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:26,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:26,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:26,706 INFO L87 Difference]: Start difference. First operand 56 states and 99 transitions. Second operand 4 states. [2020-11-06 22:26:27,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:27,004 INFO L93 Difference]: Finished difference Result 129 states and 235 transitions. [2020-11-06 22:26:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:27,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-11-06 22:26:27,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:27,008 INFO L225 Difference]: With dead ends: 129 [2020-11-06 22:26:27,008 INFO L226 Difference]: Without dead ends: 79 [2020-11-06 22:26:27,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-06 22:26:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2020-11-06 22:26:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-06 22:26:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2020-11-06 22:26:27,028 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 23 [2020-11-06 22:26:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:27,029 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2020-11-06 22:26:27,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2020-11-06 22:26:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:27,030 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:27,030 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-11-06 22:26:27,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:26:27,031 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 592501448, now seen corresponding path program 1 times [2020-11-06 22:26:27,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:27,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2381611] [2020-11-06 22:26:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:27,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:27,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2381611] [2020-11-06 22:26:27,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:27,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:27,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116749966] [2020-11-06 22:26:27,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:27,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:27,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:27,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:27,156 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand 4 states. [2020-11-06 22:26:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:27,462 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2020-11-06 22:26:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:27,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:26:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:27,466 INFO L225 Difference]: With dead ends: 119 [2020-11-06 22:26:27,466 INFO L226 Difference]: Without dead ends: 82 [2020-11-06 22:26:27,468 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-06 22:26:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2020-11-06 22:26:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-06 22:26:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 141 transitions. [2020-11-06 22:26:27,485 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 141 transitions. Word has length 24 [2020-11-06 22:26:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:27,486 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 141 transitions. [2020-11-06 22:26:27,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 141 transitions. [2020-11-06 22:26:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:27,487 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:27,487 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-11-06 22:26:27,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:26:27,488 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:27,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:27,489 INFO L82 PathProgramCache]: Analyzing trace with hash -428566906, now seen corresponding path program 1 times [2020-11-06 22:26:27,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:27,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185838209] [2020-11-06 22:26:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:27,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:27,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:27,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185838209] [2020-11-06 22:26:27,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:27,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:27,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862986209] [2020-11-06 22:26:27,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:27,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:27,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:27,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:27,644 INFO L87 Difference]: Start difference. First operand 81 states and 141 transitions. Second operand 4 states. [2020-11-06 22:26:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:27,897 INFO L93 Difference]: Finished difference Result 221 states and 398 transitions. [2020-11-06 22:26:27,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:27,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:26:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:27,901 INFO L225 Difference]: With dead ends: 221 [2020-11-06 22:26:27,901 INFO L226 Difference]: Without dead ends: 149 [2020-11-06 22:26:27,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:27,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-11-06 22:26:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2020-11-06 22:26:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-06 22:26:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 262 transitions. [2020-11-06 22:26:27,928 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 262 transitions. Word has length 24 [2020-11-06 22:26:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:27,929 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 262 transitions. [2020-11-06 22:26:27,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 262 transitions. [2020-11-06 22:26:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-06 22:26:27,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:27,931 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-11-06 22:26:27,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:26:27,931 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:27,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash 851296772, now seen corresponding path program 1 times [2020-11-06 22:26:27,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:27,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714452592] [2020-11-06 22:26:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:28,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714452592] [2020-11-06 22:26:28,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:28,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:28,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334874140] [2020-11-06 22:26:28,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:28,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:28,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:28,125 INFO L87 Difference]: Start difference. First operand 148 states and 262 transitions. Second operand 4 states. [2020-11-06 22:26:28,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:28,415 INFO L93 Difference]: Finished difference Result 192 states and 341 transitions. [2020-11-06 22:26:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:28,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-06 22:26:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:28,420 INFO L225 Difference]: With dead ends: 192 [2020-11-06 22:26:28,420 INFO L226 Difference]: Without dead ends: 189 [2020-11-06 22:26:28,422 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-11-06 22:26:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 148. [2020-11-06 22:26:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-06 22:26:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 260 transitions. [2020-11-06 22:26:28,445 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 260 transitions. Word has length 24 [2020-11-06 22:26:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:28,446 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 260 transitions. [2020-11-06 22:26:28,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 260 transitions. [2020-11-06 22:26:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:26:28,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:28,448 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-11-06 22:26:28,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:26:28,449 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:28,450 INFO L82 PathProgramCache]: Analyzing trace with hash -394063277, now seen corresponding path program 1 times [2020-11-06 22:26:28,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:28,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413944892] [2020-11-06 22:26:28,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:28,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413944892] [2020-11-06 22:26:28,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:28,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:28,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733391032] [2020-11-06 22:26:28,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:28,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:28,549 INFO L87 Difference]: Start difference. First operand 148 states and 260 transitions. Second operand 4 states. [2020-11-06 22:26:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:28,794 INFO L93 Difference]: Finished difference Result 276 states and 493 transitions. [2020-11-06 22:26:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:28,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:26:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:28,799 INFO L225 Difference]: With dead ends: 276 [2020-11-06 22:26:28,799 INFO L226 Difference]: Without dead ends: 273 [2020-11-06 22:26:28,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-11-06 22:26:28,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 200. [2020-11-06 22:26:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-06 22:26:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 350 transitions. [2020-11-06 22:26:28,830 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 350 transitions. Word has length 25 [2020-11-06 22:26:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:28,830 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 350 transitions. [2020-11-06 22:26:28,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 350 transitions. [2020-11-06 22:26:28,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:26:28,833 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:28,833 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-11-06 22:26:28,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-06 22:26:28,833 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1673926955, now seen corresponding path program 1 times [2020-11-06 22:26:28,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:28,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632586626] [2020-11-06 22:26:28,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:28,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632586626] [2020-11-06 22:26:28,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:28,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:28,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536099311] [2020-11-06 22:26:28,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:28,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:28,926 INFO L87 Difference]: Start difference. First operand 200 states and 350 transitions. Second operand 4 states. [2020-11-06 22:26:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:29,152 INFO L93 Difference]: Finished difference Result 472 states and 837 transitions. [2020-11-06 22:26:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:29,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:26:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:29,156 INFO L225 Difference]: With dead ends: 472 [2020-11-06 22:26:29,156 INFO L226 Difference]: Without dead ends: 281 [2020-11-06 22:26:29,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:29,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2020-11-06 22:26:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2020-11-06 22:26:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-11-06 22:26:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 488 transitions. [2020-11-06 22:26:29,186 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 488 transitions. Word has length 25 [2020-11-06 22:26:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:29,187 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 488 transitions. [2020-11-06 22:26:29,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 488 transitions. [2020-11-06 22:26:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:26:29,189 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:29,190 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-11-06 22:26:29,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-06 22:26:29,190 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash 675559793, now seen corresponding path program 1 times [2020-11-06 22:26:29,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:29,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089259903] [2020-11-06 22:26:29,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:29,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:29,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089259903] [2020-11-06 22:26:29,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:29,299 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:29,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238595162] [2020-11-06 22:26:29,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:29,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:29,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:29,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:29,302 INFO L87 Difference]: Start difference. First operand 280 states and 488 transitions. Second operand 4 states. [2020-11-06 22:26:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:29,565 INFO L93 Difference]: Finished difference Result 422 states and 735 transitions. [2020-11-06 22:26:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:29,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:26:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:29,568 INFO L225 Difference]: With dead ends: 422 [2020-11-06 22:26:29,569 INFO L226 Difference]: Without dead ends: 287 [2020-11-06 22:26:29,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-11-06 22:26:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2020-11-06 22:26:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-11-06 22:26:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 492 transitions. [2020-11-06 22:26:29,591 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 492 transitions. Word has length 26 [2020-11-06 22:26:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:29,591 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 492 transitions. [2020-11-06 22:26:29,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 492 transitions. [2020-11-06 22:26:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:26:29,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:29,594 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-11-06 22:26:29,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-06 22:26:29,594 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash -345508561, now seen corresponding path program 1 times [2020-11-06 22:26:29,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:29,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662243891] [2020-11-06 22:26:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:29,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:29,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662243891] [2020-11-06 22:26:29,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:29,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:29,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132764035] [2020-11-06 22:26:29,687 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:29,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:29,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:29,689 INFO L87 Difference]: Start difference. First operand 286 states and 492 transitions. Second operand 4 states. [2020-11-06 22:26:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:29,917 INFO L93 Difference]: Finished difference Result 526 states and 919 transitions. [2020-11-06 22:26:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:29,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:26:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:29,923 INFO L225 Difference]: With dead ends: 526 [2020-11-06 22:26:29,923 INFO L226 Difference]: Without dead ends: 523 [2020-11-06 22:26:29,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2020-11-06 22:26:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 394. [2020-11-06 22:26:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2020-11-06 22:26:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 668 transitions. [2020-11-06 22:26:29,949 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 668 transitions. Word has length 26 [2020-11-06 22:26:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:29,950 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 668 transitions. [2020-11-06 22:26:29,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 668 transitions. [2020-11-06 22:26:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-06 22:26:29,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:29,952 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-11-06 22:26:29,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:26:29,953 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:29,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1625372239, now seen corresponding path program 1 times [2020-11-06 22:26:29,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:29,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726535985] [2020-11-06 22:26:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:30,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726535985] [2020-11-06 22:26:30,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:30,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:30,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796878810] [2020-11-06 22:26:30,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:30,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:30,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:30,045 INFO L87 Difference]: Start difference. First operand 394 states and 668 transitions. Second operand 4 states. [2020-11-06 22:26:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:30,281 INFO L93 Difference]: Finished difference Result 926 states and 1583 transitions. [2020-11-06 22:26:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:30,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-11-06 22:26:30,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:30,286 INFO L225 Difference]: With dead ends: 926 [2020-11-06 22:26:30,286 INFO L226 Difference]: Without dead ends: 547 [2020-11-06 22:26:30,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:30,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2020-11-06 22:26:30,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 546. [2020-11-06 22:26:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-11-06 22:26:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 920 transitions. [2020-11-06 22:26:30,322 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 920 transitions. Word has length 26 [2020-11-06 22:26:30,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:30,322 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 920 transitions. [2020-11-06 22:26:30,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 920 transitions. [2020-11-06 22:26:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:26:30,327 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:30,328 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-11-06 22:26:30,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:26:30,329 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2114200736, now seen corresponding path program 1 times [2020-11-06 22:26:30,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:30,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141953561] [2020-11-06 22:26:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:30,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141953561] [2020-11-06 22:26:30,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:30,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:30,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338739915] [2020-11-06 22:26:30,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:30,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:30,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:30,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:30,487 INFO L87 Difference]: Start difference. First operand 546 states and 920 transitions. Second operand 4 states. [2020-11-06 22:26:30,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:30,723 INFO L93 Difference]: Finished difference Result 818 states and 1375 transitions. [2020-11-06 22:26:30,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:30,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:26:30,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:30,732 INFO L225 Difference]: With dead ends: 818 [2020-11-06 22:26:30,732 INFO L226 Difference]: Without dead ends: 555 [2020-11-06 22:26:30,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-11-06 22:26:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2020-11-06 22:26:30,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2020-11-06 22:26:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 920 transitions. [2020-11-06 22:26:30,767 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 920 transitions. Word has length 27 [2020-11-06 22:26:30,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:30,767 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 920 transitions. [2020-11-06 22:26:30,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 920 transitions. [2020-11-06 22:26:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:26:30,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:30,769 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-11-06 22:26:30,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-06 22:26:30,770 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:30,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1159698206, now seen corresponding path program 1 times [2020-11-06 22:26:30,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:30,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463262648] [2020-11-06 22:26:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:30,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:30,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463262648] [2020-11-06 22:26:30,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:30,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:30,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037650609] [2020-11-06 22:26:30,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:30,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:30,908 INFO L87 Difference]: Start difference. First operand 554 states and 920 transitions. Second operand 4 states. [2020-11-06 22:26:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:31,134 INFO L93 Difference]: Finished difference Result 1006 states and 1699 transitions. [2020-11-06 22:26:31,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:31,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:26:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:31,142 INFO L225 Difference]: With dead ends: 1006 [2020-11-06 22:26:31,142 INFO L226 Difference]: Without dead ends: 1003 [2020-11-06 22:26:31,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2020-11-06 22:26:31,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 778. [2020-11-06 22:26:31,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-11-06 22:26:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1264 transitions. [2020-11-06 22:26:31,183 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1264 transitions. Word has length 27 [2020-11-06 22:26:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:31,183 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1264 transitions. [2020-11-06 22:26:31,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1264 transitions. [2020-11-06 22:26:31,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:26:31,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:31,186 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-11-06 22:26:31,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-06 22:26:31,186 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:31,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:31,187 INFO L82 PathProgramCache]: Analyzing trace with hash -120165472, now seen corresponding path program 1 times [2020-11-06 22:26:31,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:31,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583790258] [2020-11-06 22:26:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:31,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:31,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583790258] [2020-11-06 22:26:31,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:31,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:31,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916446507] [2020-11-06 22:26:31,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:31,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:31,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:31,264 INFO L87 Difference]: Start difference. First operand 778 states and 1264 transitions. Second operand 4 states. [2020-11-06 22:26:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:31,543 INFO L93 Difference]: Finished difference Result 1822 states and 2979 transitions. [2020-11-06 22:26:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:31,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-06 22:26:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:31,551 INFO L225 Difference]: With dead ends: 1822 [2020-11-06 22:26:31,551 INFO L226 Difference]: Without dead ends: 1067 [2020-11-06 22:26:31,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2020-11-06 22:26:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1066. [2020-11-06 22:26:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2020-11-06 22:26:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1720 transitions. [2020-11-06 22:26:31,612 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1720 transitions. Word has length 27 [2020-11-06 22:26:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:31,613 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1720 transitions. [2020-11-06 22:26:31,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1720 transitions. [2020-11-06 22:26:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:26:31,617 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:31,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, 1, 1, 1] [2020-11-06 22:26:31,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-06 22:26:31,618 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1597546652, now seen corresponding path program 1 times [2020-11-06 22:26:31,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:31,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613276851] [2020-11-06 22:26:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:31,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:31,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613276851] [2020-11-06 22:26:31,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:31,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:31,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986539393] [2020-11-06 22:26:31,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:31,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:31,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:31,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:31,721 INFO L87 Difference]: Start difference. First operand 1066 states and 1720 transitions. Second operand 4 states. [2020-11-06 22:26:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:31,937 INFO L93 Difference]: Finished difference Result 1598 states and 2571 transitions. [2020-11-06 22:26:31,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:31,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:26:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:31,944 INFO L225 Difference]: With dead ends: 1598 [2020-11-06 22:26:31,945 INFO L226 Difference]: Without dead ends: 1083 [2020-11-06 22:26:31,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2020-11-06 22:26:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1082. [2020-11-06 22:26:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2020-11-06 22:26:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1720 transitions. [2020-11-06 22:26:31,997 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1720 transitions. Word has length 28 [2020-11-06 22:26:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:31,997 INFO L481 AbstractCegarLoop]: Abstraction has 1082 states and 1720 transitions. [2020-11-06 22:26:31,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:31,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1720 transitions. [2020-11-06 22:26:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:26:32,000 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:32,000 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-11-06 22:26:32,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-06 22:26:32,000 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:32,001 INFO L82 PathProgramCache]: Analyzing trace with hash 576478298, now seen corresponding path program 1 times [2020-11-06 22:26:32,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:32,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576641271] [2020-11-06 22:26:32,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:32,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576641271] [2020-11-06 22:26:32,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:32,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:32,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623147061] [2020-11-06 22:26:32,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:32,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:32,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:32,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:32,068 INFO L87 Difference]: Start difference. First operand 1082 states and 1720 transitions. Second operand 4 states. [2020-11-06 22:26:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:32,324 INFO L93 Difference]: Finished difference Result 1934 states and 3131 transitions. [2020-11-06 22:26:32,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:32,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:26:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:32,336 INFO L225 Difference]: With dead ends: 1934 [2020-11-06 22:26:32,336 INFO L226 Difference]: Without dead ends: 1931 [2020-11-06 22:26:32,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2020-11-06 22:26:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1546. [2020-11-06 22:26:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2020-11-06 22:26:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2392 transitions. [2020-11-06 22:26:32,435 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2392 transitions. Word has length 28 [2020-11-06 22:26:32,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:32,436 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 2392 transitions. [2020-11-06 22:26:32,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2392 transitions. [2020-11-06 22:26:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:26:32,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:32,440 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-11-06 22:26:32,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-06 22:26:32,441 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash -703385380, now seen corresponding path program 1 times [2020-11-06 22:26:32,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:32,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938869460] [2020-11-06 22:26:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:32,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938869460] [2020-11-06 22:26:32,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:32,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:32,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146741133] [2020-11-06 22:26:32,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:32,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:32,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:32,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:32,559 INFO L87 Difference]: Start difference. First operand 1546 states and 2392 transitions. Second operand 4 states. [2020-11-06 22:26:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:32,805 INFO L93 Difference]: Finished difference Result 3598 states and 5595 transitions. [2020-11-06 22:26:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:32,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-11-06 22:26:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:32,817 INFO L225 Difference]: With dead ends: 3598 [2020-11-06 22:26:32,817 INFO L226 Difference]: Without dead ends: 2091 [2020-11-06 22:26:32,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2020-11-06 22:26:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2090. [2020-11-06 22:26:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-11-06 22:26:32,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 3208 transitions. [2020-11-06 22:26:32,913 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 3208 transitions. Word has length 28 [2020-11-06 22:26:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:32,913 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 3208 transitions. [2020-11-06 22:26:32,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3208 transitions. [2020-11-06 22:26:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:26:32,917 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:32,917 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-11-06 22:26:32,917 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-06 22:26:32,917 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:32,918 INFO L82 PathProgramCache]: Analyzing trace with hash 697609259, now seen corresponding path program 1 times [2020-11-06 22:26:32,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:32,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11874511] [2020-11-06 22:26:32,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:32,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11874511] [2020-11-06 22:26:32,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:32,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:32,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126565517] [2020-11-06 22:26:32,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:32,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:32,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:32,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:32,981 INFO L87 Difference]: Start difference. First operand 2090 states and 3208 transitions. Second operand 4 states. [2020-11-06 22:26:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:33,226 INFO L93 Difference]: Finished difference Result 3134 states and 4795 transitions. [2020-11-06 22:26:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:33,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:26:33,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:33,238 INFO L225 Difference]: With dead ends: 3134 [2020-11-06 22:26:33,239 INFO L226 Difference]: Without dead ends: 2123 [2020-11-06 22:26:33,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2020-11-06 22:26:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2122. [2020-11-06 22:26:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-11-06 22:26:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 3208 transitions. [2020-11-06 22:26:33,331 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 3208 transitions. Word has length 29 [2020-11-06 22:26:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:33,331 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 3208 transitions. [2020-11-06 22:26:33,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 3208 transitions. [2020-11-06 22:26:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:26:33,334 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:33,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] [2020-11-06 22:26:33,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-06 22:26:33,335 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:33,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:33,335 INFO L82 PathProgramCache]: Analyzing trace with hash -323459095, now seen corresponding path program 1 times [2020-11-06 22:26:33,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:33,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078616074] [2020-11-06 22:26:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:33,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:33,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:33,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078616074] [2020-11-06 22:26:33,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:33,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:33,400 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607350159] [2020-11-06 22:26:33,402 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:33,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:33,405 INFO L87 Difference]: Start difference. First operand 2122 states and 3208 transitions. Second operand 4 states. [2020-11-06 22:26:33,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:33,666 INFO L93 Difference]: Finished difference Result 3726 states and 5739 transitions. [2020-11-06 22:26:33,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:33,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:26:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:33,688 INFO L225 Difference]: With dead ends: 3726 [2020-11-06 22:26:33,688 INFO L226 Difference]: Without dead ends: 3723 [2020-11-06 22:26:33,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2020-11-06 22:26:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3082. [2020-11-06 22:26:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3082 states. [2020-11-06 22:26:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4520 transitions. [2020-11-06 22:26:33,823 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4520 transitions. Word has length 29 [2020-11-06 22:26:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:33,823 INFO L481 AbstractCegarLoop]: Abstraction has 3082 states and 4520 transitions. [2020-11-06 22:26:33,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:33,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4520 transitions. [2020-11-06 22:26:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:26:33,829 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:33,829 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-11-06 22:26:33,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-06 22:26:33,830 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:33,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1603322773, now seen corresponding path program 1 times [2020-11-06 22:26:33,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:33,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832102842] [2020-11-06 22:26:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:33,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:33,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832102842] [2020-11-06 22:26:33,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:33,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:33,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884624283] [2020-11-06 22:26:33,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:33,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:33,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:33,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:33,941 INFO L87 Difference]: Start difference. First operand 3082 states and 4520 transitions. Second operand 4 states. [2020-11-06 22:26:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:34,207 INFO L93 Difference]: Finished difference Result 7118 states and 10475 transitions. [2020-11-06 22:26:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:34,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-11-06 22:26:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:34,230 INFO L225 Difference]: With dead ends: 7118 [2020-11-06 22:26:34,231 INFO L226 Difference]: Without dead ends: 4107 [2020-11-06 22:26:34,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:34,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2020-11-06 22:26:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4106. [2020-11-06 22:26:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4106 states. [2020-11-06 22:26:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4106 states to 4106 states and 5960 transitions. [2020-11-06 22:26:34,410 INFO L78 Accepts]: Start accepts. Automaton has 4106 states and 5960 transitions. Word has length 29 [2020-11-06 22:26:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:34,410 INFO L481 AbstractCegarLoop]: Abstraction has 4106 states and 5960 transitions. [2020-11-06 22:26:34,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4106 states and 5960 transitions. [2020-11-06 22:26:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:26:34,418 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:34,418 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-11-06 22:26:34,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-06 22:26:34,419 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:34,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:34,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1430635577, now seen corresponding path program 1 times [2020-11-06 22:26:34,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:34,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181895110] [2020-11-06 22:26:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:34,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:34,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181895110] [2020-11-06 22:26:34,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:34,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:34,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021185923] [2020-11-06 22:26:34,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:34,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:34,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:34,492 INFO L87 Difference]: Start difference. First operand 4106 states and 5960 transitions. Second operand 4 states. [2020-11-06 22:26:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:34,758 INFO L93 Difference]: Finished difference Result 6158 states and 8907 transitions. [2020-11-06 22:26:34,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:34,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:26:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:34,804 INFO L225 Difference]: With dead ends: 6158 [2020-11-06 22:26:34,804 INFO L226 Difference]: Without dead ends: 4171 [2020-11-06 22:26:34,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2020-11-06 22:26:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4170. [2020-11-06 22:26:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2020-11-06 22:26:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 5960 transitions. [2020-11-06 22:26:34,975 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 5960 transitions. Word has length 30 [2020-11-06 22:26:34,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:34,975 INFO L481 AbstractCegarLoop]: Abstraction has 4170 states and 5960 transitions. [2020-11-06 22:26:34,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 5960 transitions. [2020-11-06 22:26:34,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:26:34,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:34,985 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-11-06 22:26:34,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-06 22:26:34,985 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1843263365, now seen corresponding path program 1 times [2020-11-06 22:26:34,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:34,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695355433] [2020-11-06 22:26:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:35,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:35,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695355433] [2020-11-06 22:26:35,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:35,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:35,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040155876] [2020-11-06 22:26:35,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:35,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:35,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:35,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:35,056 INFO L87 Difference]: Start difference. First operand 4170 states and 5960 transitions. Second operand 4 states. [2020-11-06 22:26:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:35,371 INFO L93 Difference]: Finished difference Result 7182 states and 10443 transitions. [2020-11-06 22:26:35,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:35,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:26:35,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:35,387 INFO L225 Difference]: With dead ends: 7182 [2020-11-06 22:26:35,388 INFO L226 Difference]: Without dead ends: 7179 [2020-11-06 22:26:35,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2020-11-06 22:26:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6154. [2020-11-06 22:26:35,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2020-11-06 22:26:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 8520 transitions. [2020-11-06 22:26:35,563 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 8520 transitions. Word has length 30 [2020-11-06 22:26:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:35,564 INFO L481 AbstractCegarLoop]: Abstraction has 6154 states and 8520 transitions. [2020-11-06 22:26:35,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 8520 transitions. [2020-11-06 22:26:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-06 22:26:35,574 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:35,574 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-11-06 22:26:35,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-06 22:26:35,574 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:35,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:35,575 INFO L82 PathProgramCache]: Analyzing trace with hash 563399687, now seen corresponding path program 1 times [2020-11-06 22:26:35,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:35,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473573393] [2020-11-06 22:26:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:35,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:35,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473573393] [2020-11-06 22:26:35,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:35,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:35,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850043078] [2020-11-06 22:26:35,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:35,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:35,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:35,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:35,646 INFO L87 Difference]: Start difference. First operand 6154 states and 8520 transitions. Second operand 4 states. [2020-11-06 22:26:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:35,991 INFO L93 Difference]: Finished difference Result 14094 states and 19531 transitions. [2020-11-06 22:26:35,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:35,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-11-06 22:26:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:36,011 INFO L225 Difference]: With dead ends: 14094 [2020-11-06 22:26:36,012 INFO L226 Difference]: Without dead ends: 8075 [2020-11-06 22:26:36,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:36,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2020-11-06 22:26:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8074. [2020-11-06 22:26:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8074 states. [2020-11-06 22:26:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 11016 transitions. [2020-11-06 22:26:36,256 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 11016 transitions. Word has length 30 [2020-11-06 22:26:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:36,257 INFO L481 AbstractCegarLoop]: Abstraction has 8074 states and 11016 transitions. [2020-11-06 22:26:36,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 11016 transitions. [2020-11-06 22:26:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:26:36,268 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:36,268 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-11-06 22:26:36,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-06 22:26:36,269 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1313261814, now seen corresponding path program 1 times [2020-11-06 22:26:36,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:36,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55898925] [2020-11-06 22:26:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:36,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:36,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:36,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55898925] [2020-11-06 22:26:36,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:36,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:36,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905387913] [2020-11-06 22:26:36,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:36,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:36,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:36,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:36,331 INFO L87 Difference]: Start difference. First operand 8074 states and 11016 transitions. Second operand 4 states. [2020-11-06 22:26:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:36,669 INFO L93 Difference]: Finished difference Result 12110 states and 16459 transitions. [2020-11-06 22:26:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:36,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-11-06 22:26:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:36,690 INFO L225 Difference]: With dead ends: 12110 [2020-11-06 22:26:36,690 INFO L226 Difference]: Without dead ends: 8203 [2020-11-06 22:26:36,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2020-11-06 22:26:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8202. [2020-11-06 22:26:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8202 states. [2020-11-06 22:26:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 11016 transitions. [2020-11-06 22:26:37,055 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 11016 transitions. Word has length 31 [2020-11-06 22:26:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:37,055 INFO L481 AbstractCegarLoop]: Abstraction has 8202 states and 11016 transitions. [2020-11-06 22:26:37,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 11016 transitions. [2020-11-06 22:26:37,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:26:37,065 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:37,066 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-11-06 22:26:37,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-06 22:26:37,066 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:37,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:37,066 INFO L82 PathProgramCache]: Analyzing trace with hash 292193460, now seen corresponding path program 1 times [2020-11-06 22:26:37,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:37,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198585685] [2020-11-06 22:26:37,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:37,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:37,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198585685] [2020-11-06 22:26:37,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:37,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:37,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530612077] [2020-11-06 22:26:37,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:37,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:37,121 INFO L87 Difference]: Start difference. First operand 8202 states and 11016 transitions. Second operand 4 states. [2020-11-06 22:26:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:37,478 INFO L93 Difference]: Finished difference Result 13838 states and 18827 transitions. [2020-11-06 22:26:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:37,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-11-06 22:26:37,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:37,510 INFO L225 Difference]: With dead ends: 13838 [2020-11-06 22:26:37,511 INFO L226 Difference]: Without dead ends: 13835 [2020-11-06 22:26:37,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:37,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2020-11-06 22:26:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12298. [2020-11-06 22:26:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12298 states. [2020-11-06 22:26:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12298 states to 12298 states and 16008 transitions. [2020-11-06 22:26:37,958 INFO L78 Accepts]: Start accepts. Automaton has 12298 states and 16008 transitions. Word has length 31 [2020-11-06 22:26:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:37,958 INFO L481 AbstractCegarLoop]: Abstraction has 12298 states and 16008 transitions. [2020-11-06 22:26:37,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 12298 states and 16008 transitions. [2020-11-06 22:26:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-11-06 22:26:37,980 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:37,980 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-11-06 22:26:37,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-06 22:26:37,982 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash -987670218, now seen corresponding path program 1 times [2020-11-06 22:26:37,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:37,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945109380] [2020-11-06 22:26:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:38,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:38,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945109380] [2020-11-06 22:26:38,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:38,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:38,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688294441] [2020-11-06 22:26:38,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:38,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:38,058 INFO L87 Difference]: Start difference. First operand 12298 states and 16008 transitions. Second operand 4 states. [2020-11-06 22:26:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:38,532 INFO L93 Difference]: Finished difference Result 27918 states and 36235 transitions. [2020-11-06 22:26:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:38,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-11-06 22:26:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:38,566 INFO L225 Difference]: With dead ends: 27918 [2020-11-06 22:26:38,567 INFO L226 Difference]: Without dead ends: 15883 [2020-11-06 22:26:38,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2020-11-06 22:26:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15882. [2020-11-06 22:26:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15882 states. [2020-11-06 22:26:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15882 states to 15882 states and 20232 transitions. [2020-11-06 22:26:39,069 INFO L78 Accepts]: Start accepts. Automaton has 15882 states and 20232 transitions. Word has length 31 [2020-11-06 22:26:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:39,069 INFO L481 AbstractCegarLoop]: Abstraction has 15882 states and 20232 transitions. [2020-11-06 22:26:39,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15882 states and 20232 transitions. [2020-11-06 22:26:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:26:39,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:39,211 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, 1] [2020-11-06 22:26:39,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-06 22:26:39,211 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash 474745586, now seen corresponding path program 1 times [2020-11-06 22:26:39,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:39,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223996100] [2020-11-06 22:26:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:39,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:39,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223996100] [2020-11-06 22:26:39,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:39,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:39,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864364978] [2020-11-06 22:26:39,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:39,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:39,274 INFO L87 Difference]: Start difference. First operand 15882 states and 20232 transitions. Second operand 4 states. [2020-11-06 22:26:39,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:39,695 INFO L93 Difference]: Finished difference Result 23822 states and 30219 transitions. [2020-11-06 22:26:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:39,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-11-06 22:26:39,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:39,738 INFO L225 Difference]: With dead ends: 23822 [2020-11-06 22:26:39,738 INFO L226 Difference]: Without dead ends: 16139 [2020-11-06 22:26:39,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2020-11-06 22:26:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16138. [2020-11-06 22:26:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16138 states. [2020-11-06 22:26:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16138 states to 16138 states and 20232 transitions. [2020-11-06 22:26:40,394 INFO L78 Accepts]: Start accepts. Automaton has 16138 states and 20232 transitions. Word has length 32 [2020-11-06 22:26:40,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:40,394 INFO L481 AbstractCegarLoop]: Abstraction has 16138 states and 20232 transitions. [2020-11-06 22:26:40,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 16138 states and 20232 transitions. [2020-11-06 22:26:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:26:40,416 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:40,417 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, 1] [2020-11-06 22:26:40,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-06 22:26:40,417 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash -546322768, now seen corresponding path program 1 times [2020-11-06 22:26:40,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:40,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637198417] [2020-11-06 22:26:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:40,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:40,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637198417] [2020-11-06 22:26:40,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:40,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:40,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663931881] [2020-11-06 22:26:40,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:40,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:40,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:40,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:40,472 INFO L87 Difference]: Start difference. First operand 16138 states and 20232 transitions. Second operand 4 states. [2020-11-06 22:26:41,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:41,304 INFO L93 Difference]: Finished difference Result 46862 states and 57611 transitions. [2020-11-06 22:26:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:41,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-11-06 22:26:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:41,357 INFO L225 Difference]: With dead ends: 46862 [2020-11-06 22:26:41,358 INFO L226 Difference]: Without dead ends: 31243 [2020-11-06 22:26:41,394 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2020-11-06 22:26:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31242. [2020-11-06 22:26:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31242 states. [2020-11-06 22:26:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31242 states to 31242 states and 37384 transitions. [2020-11-06 22:26:42,362 INFO L78 Accepts]: Start accepts. Automaton has 31242 states and 37384 transitions. Word has length 32 [2020-11-06 22:26:42,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:42,363 INFO L481 AbstractCegarLoop]: Abstraction has 31242 states and 37384 transitions. [2020-11-06 22:26:42,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 31242 states and 37384 transitions. [2020-11-06 22:26:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:26:42,394 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:42,394 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, 1] [2020-11-06 22:26:42,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-06 22:26:42,394 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:42,395 INFO L82 PathProgramCache]: Analyzing trace with hash 733540910, now seen corresponding path program 1 times [2020-11-06 22:26:42,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:42,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528307192] [2020-11-06 22:26:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:42,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:42,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528307192] [2020-11-06 22:26:42,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:42,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:42,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886908010] [2020-11-06 22:26:42,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:42,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:42,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:42,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:42,456 INFO L87 Difference]: Start difference. First operand 31242 states and 37384 transitions. Second operand 4 states. [2020-11-06 22:26:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:43,522 INFO L93 Difference]: Finished difference Result 33294 states and 40459 transitions. [2020-11-06 22:26:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:43,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2020-11-06 22:26:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:43,562 INFO L225 Difference]: With dead ends: 33294 [2020-11-06 22:26:43,562 INFO L226 Difference]: Without dead ends: 33291 [2020-11-06 22:26:43,569 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:43,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33291 states. [2020-11-06 22:26:44,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33291 to 31242. [2020-11-06 22:26:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31242 states. [2020-11-06 22:26:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31242 states to 31242 states and 36872 transitions. [2020-11-06 22:26:44,475 INFO L78 Accepts]: Start accepts. Automaton has 31242 states and 36872 transitions. Word has length 32 [2020-11-06 22:26:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:44,475 INFO L481 AbstractCegarLoop]: Abstraction has 31242 states and 36872 transitions. [2020-11-06 22:26:44,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31242 states and 36872 transitions. [2020-11-06 22:26:44,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-06 22:26:44,490 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:44,490 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, 1, 1] [2020-11-06 22:26:44,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-06 22:26:44,490 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:44,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:44,491 INFO L82 PathProgramCache]: Analyzing trace with hash 250556865, now seen corresponding path program 1 times [2020-11-06 22:26:44,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:44,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001063263] [2020-11-06 22:26:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:44,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:26:44,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001063263] [2020-11-06 22:26:44,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:44,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:44,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350567133] [2020-11-06 22:26:44,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:44,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:44,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:44,553 INFO L87 Difference]: Start difference. First operand 31242 states and 36872 transitions. Second operand 4 states. [2020-11-06 22:26:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:45,540 INFO L93 Difference]: Finished difference Result 50701 states and 59402 transitions. [2020-11-06 22:26:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:45,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-06 22:26:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:45,612 INFO L225 Difference]: With dead ends: 50701 [2020-11-06 22:26:45,612 INFO L226 Difference]: Without dead ends: 50698 [2020-11-06 22:26:45,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50698 states. [2020-11-06 22:26:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50698 to 48650. [2020-11-06 22:26:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48650 states. [2020-11-06 22:26:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48650 states to 48650 states and 56328 transitions. [2020-11-06 22:26:46,930 INFO L78 Accepts]: Start accepts. Automaton has 48650 states and 56328 transitions. Word has length 33 [2020-11-06 22:26:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:46,930 INFO L481 AbstractCegarLoop]: Abstraction has 48650 states and 56328 transitions. [2020-11-06 22:26:46,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 48650 states and 56328 transitions. [2020-11-06 22:26:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-06 22:26:46,990 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:26:46,990 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, 1, 1] [2020-11-06 22:26:46,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-06 22:26:46,992 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:26:46,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:26:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1029306813, now seen corresponding path program 1 times [2020-11-06 22:26:46,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:26:46,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812167060] [2020-11-06 22:26:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:26:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:47,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:26:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:26:47,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-11-06 22:26:47,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812167060] [2020-11-06 22:26:47,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:26:47,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:26:47,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709873666] [2020-11-06 22:26:47,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:26:47,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:26:47,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:26:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:26:47,048 INFO L87 Difference]: Start difference. First operand 48650 states and 56328 transitions. Second operand 4 states. [2020-11-06 22:26:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:26:48,306 INFO L93 Difference]: Finished difference Result 109066 states and 124936 transitions. [2020-11-06 22:26:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:26:48,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-06 22:26:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:26:48,307 INFO L225 Difference]: With dead ends: 109066 [2020-11-06 22:26:48,307 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:26:48,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:26:48,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:26:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:26:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:26:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:26:48,390 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-11-06 22:26:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:26:48,390 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:26:48,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:26:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:26:48,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:26:48,391 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-06 22:26:48,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:30:56,464 WARN L194 SmtUtils]: Spent 4.13 m on a formula simplification. DAG size of input: 8275 DAG size of output: 32 [2020-11-06 22:30:56,513 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:30:56,514 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:30:56,514 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:30:56,514 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:30:56,514 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:30:56,515 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point L159-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point L93-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 6 179) no Hoare annotation was computed. [2020-11-06 22:30:56,515 INFO L266 CegarLoopResult]: For program point L85-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,516 INFO L266 CegarLoopResult]: For program point L77-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,516 INFO L266 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2020-11-06 22:30:56,516 INFO L266 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2020-11-06 22:30:56,516 INFO L266 CegarLoopResult]: For program point L119-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point L144-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L269 CegarLoopResult]: At program point L169-1(lines 44 174) the Hoare annotation is: true [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 6 179) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L266 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-11-06 22:30:56,518 INFO L262 CegarLoopResult]: At program point L170-1(lines 7 179) the Hoare annotation is: false [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L129-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 6 179) the Hoare annotation is: true [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L154-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L113-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L105-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L130(line 130) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L97-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L89-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L81-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,519 INFO L266 CegarLoopResult]: For program point L139-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L73(lines 73 75) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L73-2(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L164-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L124-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L149-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2020-11-06 22:30:56,520 INFO L269 CegarLoopResult]: At program point L175(lines 7 179) the Hoare annotation is: true [2020-11-06 22:30:56,520 INFO L266 CegarLoopResult]: For program point L109-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,521 INFO L266 CegarLoopResult]: For program point L134-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,521 INFO L266 CegarLoopResult]: For program point L101-1(lines 44 174) no Hoare annotation was computed. [2020-11-06 22:30:56,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:30:56 BoogieIcfgContainer [2020-11-06 22:30:56,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:30:56,545 INFO L168 Benchmark]: Toolchain (without parser) took 272822.59 ms. Allocated memory was 159.4 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 135.2 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.2 GB. Max. memory is 8.0 GB. [2020-11-06 22:30:56,546 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 159.4 MB. Free memory is still 132.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:30:56,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.44 ms. Allocated memory is still 159.4 MB. Free memory was 134.5 MB in the beginning and 124.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:30:56,551 INFO L168 Benchmark]: Boogie Preprocessor took 121.71 ms. Allocated memory is still 159.4 MB. Free memory was 124.0 MB in the beginning and 122.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:30:56,551 INFO L168 Benchmark]: RCFGBuilder took 914.36 ms. Allocated memory is still 159.4 MB. Free memory was 122.3 MB in the beginning and 133.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:30:56,552 INFO L168 Benchmark]: TraceAbstraction took 271406.09 ms. Allocated memory was 159.4 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 132.7 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.2 GB. Max. memory is 8.0 GB. [2020-11-06 22:30:56,553 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 159.4 MB. Free memory is still 132.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 358.44 ms. Allocated memory is still 159.4 MB. Free memory was 134.5 MB in the beginning and 124.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 121.71 ms. Allocated memory is still 159.4 MB. Free memory was 124.0 MB in the beginning and 122.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 914.36 ms. Allocated memory is still 159.4 MB. Free memory was 122.3 MB in the beginning and 133.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 271406.09 ms. Allocated memory was 159.4 MB in the beginning and 4.5 GB in the end (delta: 4.3 GB). Free memory was 132.7 MB in the beginning and 3.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.2 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 44]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 248.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2829 SDtfs, 4152 SDslu, 233 SDs, 0 SdLazy, 2031 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48650occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 8194 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 37 PreInvPairs, 2088 NumberOfFragments, 38 HoareAnnotationTreeSize, 37 FomulaSimplifications, 164876390 FormulaSimplificationTreeSizeReduction, 248.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 843 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 813 ConstructedInterpolants, 0 QuantifiedInterpolants, 67582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...