/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:49:31,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:49:31,637 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:49:31,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:49:31,697 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:49:31,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:49:31,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:49:31,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:49:31,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:49:31,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:49:31,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:49:31,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:49:31,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:49:31,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:49:31,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:49:31,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:49:31,774 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:49:31,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:49:31,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:49:31,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:49:31,806 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:49:31,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:49:31,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:49:31,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:49:31,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:49:31,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:49:31,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:49:31,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:49:31,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:49:31,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:49:31,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:49:31,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:49:31,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:49:31,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:49:31,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:49:31,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:49:31,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:49:31,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:49:31,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:49:31,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:49:31,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:49:31,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:49:31,863 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:49:31,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:49:31,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:49:31,869 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:49:31,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:49:31,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:49:31,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:49:31,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:49:31,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:49:31,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:49:31,871 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:49:31,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:49:31,871 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:49:31,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:49:31,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:49:31,872 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:49:31,873 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:49:31,873 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:49:31,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:49:31,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:49:31,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:49:31,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:49:31,874 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:49:32,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:49:32,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:49:32,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:49:32,372 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:49:32,373 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:49:32,374 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2020-11-07 06:49:32,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c04582f/4824978cd6ac449ebc8976434bb41fe7/FLAG7a802269b [2020-11-07 06:49:33,056 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:49:33,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2020-11-07 06:49:33,066 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c04582f/4824978cd6ac449ebc8976434bb41fe7/FLAG7a802269b [2020-11-07 06:49:33,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17c04582f/4824978cd6ac449ebc8976434bb41fe7 [2020-11-07 06:49:33,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:49:33,394 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:49:33,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:33,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:49:33,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:49:33,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e09d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33, skipping insertion in model container [2020-11-07 06:49:33,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:49:33,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:49:33,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:33,681 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:49:33,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:49:33,725 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:49:33,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33 WrapperNode [2020-11-07 06:49:33,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:49:33,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:49:33,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:49:33,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:49:33,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (1/1) ... [2020-11-07 06:49:33,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:49:33,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:49:33,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:49:33,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:49:33,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (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-07 06:49:33,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:49:33,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:49:33,930 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:49:33,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:49:33,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:49:33,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:49:33,931 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:49:33,931 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:49:33,931 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:49:33,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:49:33,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:49:33,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:49:33,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:49:33,932 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:49:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:49:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:49:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:49:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:49:33,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:49:33,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:49:34,415 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:49:34,416 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:49:34,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:34 BoogieIcfgContainer [2020-11-07 06:49:34,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:49:34,421 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:49:34,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:49:34,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:49:34,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:49:33" (1/3) ... [2020-11-07 06:49:34,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef312ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:34, skipping insertion in model container [2020-11-07 06:49:34,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:49:33" (2/3) ... [2020-11-07 06:49:34,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef312ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:49:34, skipping insertion in model container [2020-11-07 06:49:34,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:49:34" (3/3) ... [2020-11-07 06:49:34,429 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt8.c [2020-11-07 06:49:34,451 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:49:34,456 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:49:34,477 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:49:34,514 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:49:34,514 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:49:34,514 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:49:34,515 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:49:34,515 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:49:34,515 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:49:34,515 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:49:34,515 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:49:34,544 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-11-07 06:49:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 06:49:34,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:34,562 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, 1, 1, 1] [2020-11-07 06:49:34,563 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1693041709, now seen corresponding path program 1 times [2020-11-07 06:49:34,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:34,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865442158] [2020-11-07 06:49:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,669 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2020-11-07 06:49:35,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:35,792 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-07 06:49:35,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865442158] [2020-11-07 06:49:35,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:49:35,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 06:49:35,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459855648] [2020-11-07 06:49:35,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:49:35,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:35,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:49:35,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:49:35,822 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 16 states. [2020-11-07 06:49:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:37,599 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2020-11-07 06:49:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:49:37,601 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2020-11-07 06:49:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:37,615 INFO L225 Difference]: With dead ends: 185 [2020-11-07 06:49:37,615 INFO L226 Difference]: Without dead ends: 131 [2020-11-07 06:49:37,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:49:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-11-07 06:49:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 61. [2020-11-07 06:49:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 06:49:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-11-07 06:49:37,727 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 36 [2020-11-07 06:49:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:37,727 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-11-07 06:49:37,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:49:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-11-07 06:49:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 06:49:37,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:37,730 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:37,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:49:37,731 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -184005851, now seen corresponding path program 1 times [2020-11-07 06:49:37,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:37,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [285929095] [2020-11-07 06:49:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:37,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [285929095] [2020-11-07 06:49:37,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:37,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:37,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854315066] [2020-11-07 06:49:37,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:37,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:37,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:37,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:37,926 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2020-11-07 06:49:38,179 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-11-07 06:49:40,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:40,622 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2020-11-07 06:49:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:40,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-11-07 06:49:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:40,625 INFO L225 Difference]: With dead ends: 102 [2020-11-07 06:49:40,625 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 06:49:40,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 06:49:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2020-11-07 06:49:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 06:49:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2020-11-07 06:49:40,654 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 45 [2020-11-07 06:49:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:40,654 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2020-11-07 06:49:40,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2020-11-07 06:49:40,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 06:49:40,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:40,657 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:40,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:49:40,657 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:40,658 INFO L82 PathProgramCache]: Analyzing trace with hash 7172381, now seen corresponding path program 1 times [2020-11-07 06:49:40,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:40,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [768177774] [2020-11-07 06:49:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:40,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:40,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:40,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [768177774] [2020-11-07 06:49:40,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:40,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:40,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443747210] [2020-11-07 06:49:40,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:40,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:40,982 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2020-11-07 06:49:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:41,474 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2020-11-07 06:49:41,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:41,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-11-07 06:49:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:41,477 INFO L225 Difference]: With dead ends: 101 [2020-11-07 06:49:41,477 INFO L226 Difference]: Without dead ends: 76 [2020-11-07 06:49:41,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-07 06:49:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-11-07 06:49:41,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 06:49:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2020-11-07 06:49:41,506 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 46 [2020-11-07 06:49:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:41,507 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2020-11-07 06:49:41,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2020-11-07 06:49:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 06:49:41,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:41,509 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:41,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:49:41,510 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1626182229, now seen corresponding path program 1 times [2020-11-07 06:49:41,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:41,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1593316100] [2020-11-07 06:49:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:41,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:41,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:41,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1593316100] [2020-11-07 06:49:41,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:41,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:41,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746701763] [2020-11-07 06:49:41,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:41,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:41,686 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 5 states. [2020-11-07 06:49:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:44,211 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2020-11-07 06:49:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:44,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-11-07 06:49:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:44,213 INFO L225 Difference]: With dead ends: 91 [2020-11-07 06:49:44,213 INFO L226 Difference]: Without dead ends: 66 [2020-11-07 06:49:44,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-07 06:49:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2020-11-07 06:49:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 06:49:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-11-07 06:49:44,240 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 47 [2020-11-07 06:49:44,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:44,241 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-11-07 06:49:44,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-11-07 06:49:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-07 06:49:44,243 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:44,243 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:44,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:49:44,244 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash 309487203, now seen corresponding path program 1 times [2020-11-07 06:49:44,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:44,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1954107682] [2020-11-07 06:49:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:44,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:44,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:44,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:44,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1954107682] [2020-11-07 06:49:44,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:44,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:44,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871662602] [2020-11-07 06:49:44,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:44,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:44,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:44,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:44,442 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 5 states. [2020-11-07 06:49:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:44,901 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2020-11-07 06:49:44,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:44,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-11-07 06:49:44,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:44,903 INFO L225 Difference]: With dead ends: 99 [2020-11-07 06:49:44,904 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 06:49:44,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 06:49:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2020-11-07 06:49:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 06:49:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-11-07 06:49:44,975 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 48 [2020-11-07 06:49:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:44,975 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-11-07 06:49:44,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-11-07 06:49:44,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:49:44,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:44,978 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:44,978 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:49:44,978 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:44,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:44,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1215752241, now seen corresponding path program 1 times [2020-11-07 06:49:44,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:44,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227497630] [2020-11-07 06:49:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:45,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227497630] [2020-11-07 06:49:45,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:45,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:45,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814040329] [2020-11-07 06:49:45,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:45,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:45,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:45,101 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2020-11-07 06:49:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:45,478 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2020-11-07 06:49:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:45,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-11-07 06:49:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:45,480 INFO L225 Difference]: With dead ends: 98 [2020-11-07 06:49:45,480 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 06:49:45,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:45,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 06:49:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-11-07 06:49:45,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 06:49:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2020-11-07 06:49:45,509 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 49 [2020-11-07 06:49:45,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:45,509 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2020-11-07 06:49:45,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2020-11-07 06:49:45,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-07 06:49:45,511 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:45,511 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:45,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:49:45,511 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:45,512 INFO L82 PathProgramCache]: Analyzing trace with hash 275252137, now seen corresponding path program 1 times [2020-11-07 06:49:45,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:45,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [135043543] [2020-11-07 06:49:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:45,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [135043543] [2020-11-07 06:49:45,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:45,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:45,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793042379] [2020-11-07 06:49:45,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:45,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:45,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:45,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:45,970 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2020-11-07 06:49:51,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:51,033 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2020-11-07 06:49:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:49:51,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-11-07 06:49:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:51,035 INFO L225 Difference]: With dead ends: 97 [2020-11-07 06:49:51,035 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 06:49:51,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:49:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 06:49:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2020-11-07 06:49:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 06:49:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2020-11-07 06:49:51,068 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 50 [2020-11-07 06:49:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:51,068 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2020-11-07 06:49:51,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2020-11-07 06:49:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-07 06:49:51,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:51,074 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:51,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:49:51,074 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1515582231, now seen corresponding path program 1 times [2020-11-07 06:49:51,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:51,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643261687] [2020-11-07 06:49:51,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:51,635 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-11-07 06:49:51,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:51,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:51,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643261687] [2020-11-07 06:49:51,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:51,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 06:49:51,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442071790] [2020-11-07 06:49:51,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 06:49:51,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 06:49:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:49:51,745 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 18 states. [2020-11-07 06:49:53,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:53,486 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2020-11-07 06:49:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:49:53,487 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2020-11-07 06:49:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:53,489 INFO L225 Difference]: With dead ends: 132 [2020-11-07 06:49:53,490 INFO L226 Difference]: Without dead ends: 129 [2020-11-07 06:49:53,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:49:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-11-07 06:49:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 76. [2020-11-07 06:49:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-07 06:49:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-11-07 06:49:53,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 51 [2020-11-07 06:49:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:53,532 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-11-07 06:49:53,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 06:49:53,533 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-11-07 06:49:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-07 06:49:53,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:53,536 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:53,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:49:53,536 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2080392521, now seen corresponding path program 1 times [2020-11-07 06:49:53,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:53,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [236001027] [2020-11-07 06:49:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:53,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:53,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:49:53,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [236001027] [2020-11-07 06:49:53,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:53,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-11-07 06:49:53,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998849066] [2020-11-07 06:49:53,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-07 06:49:53,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-07 06:49:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:49:53,703 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 5 states. [2020-11-07 06:49:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:54,056 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-11-07 06:49:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:49:54,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-11-07 06:49:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:54,060 INFO L225 Difference]: With dead ends: 101 [2020-11-07 06:49:54,061 INFO L226 Difference]: Without dead ends: 76 [2020-11-07 06:49:54,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:49:54,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-11-07 06:49:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-11-07 06:49:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-07 06:49:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-11-07 06:49:54,092 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 51 [2020-11-07 06:49:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:54,092 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-11-07 06:49:54,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-07 06:49:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-11-07 06:49:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 06:49:54,093 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:54,093 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:54,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:49:54,094 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -695123077, now seen corresponding path program 2 times [2020-11-07 06:49:54,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:54,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919456597] [2020-11-07 06:49:54,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:54,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:54,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:54,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:49:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:54,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1919456597] [2020-11-07 06:49:54,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:54,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:49:54,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920514735] [2020-11-07 06:49:54,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:49:54,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:49:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:49:54,260 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2020-11-07 06:49:54,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:54,767 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2020-11-07 06:49:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:49:54,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-11-07 06:49:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:54,770 INFO L225 Difference]: With dead ends: 117 [2020-11-07 06:49:54,771 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 06:49:54,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 06:49:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2020-11-07 06:49:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-07 06:49:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2020-11-07 06:49:54,805 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 60 [2020-11-07 06:49:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:54,806 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2020-11-07 06:49:54,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:49:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2020-11-07 06:49:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 06:49:54,807 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:54,807 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:54,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:49:54,807 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:54,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:54,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1342407559, now seen corresponding path program 1 times [2020-11-07 06:49:54,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:54,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866894471] [2020-11-07 06:49:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:55,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:55,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:55,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:49:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:55,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866894471] [2020-11-07 06:49:55,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:55,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:49:55,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076546327] [2020-11-07 06:49:55,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:49:55,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:55,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:49:55,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:49:55,222 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 9 states. [2020-11-07 06:49:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:56,165 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2020-11-07 06:49:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:56,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-11-07 06:49:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:56,167 INFO L225 Difference]: With dead ends: 116 [2020-11-07 06:49:56,167 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 06:49:56,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:49:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 06:49:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2020-11-07 06:49:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 06:49:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-11-07 06:49:56,204 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 61 [2020-11-07 06:49:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:56,206 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-11-07 06:49:56,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:49:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-11-07 06:49:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 06:49:56,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:56,207 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:56,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:49:56,208 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1111402625, now seen corresponding path program 1 times [2020-11-07 06:49:56,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:56,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840794777] [2020-11-07 06:49:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:56,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:56,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:56,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:49:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:56,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840794777] [2020-11-07 06:49:56,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:56,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:49:56,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134557196] [2020-11-07 06:49:56,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:49:56,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:49:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:49:56,767 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 10 states. [2020-11-07 06:49:57,126 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:49:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:57,784 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2020-11-07 06:49:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:57,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2020-11-07 06:49:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:57,786 INFO L225 Difference]: With dead ends: 115 [2020-11-07 06:49:57,786 INFO L226 Difference]: Without dead ends: 90 [2020-11-07 06:49:57,787 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-07 06:49:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2020-11-07 06:49:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 06:49:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2020-11-07 06:49:57,824 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 62 [2020-11-07 06:49:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:57,825 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2020-11-07 06:49:57,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:49:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2020-11-07 06:49:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 06:49:57,826 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:57,826 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:57,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:49:57,826 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:57,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:57,827 INFO L82 PathProgramCache]: Analyzing trace with hash -724728243, now seen corresponding path program 1 times [2020-11-07 06:49:57,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:57,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1975775323] [2020-11-07 06:49:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:58,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:58,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:58,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:49:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:58,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1975775323] [2020-11-07 06:49:58,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:58,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:49:58,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811573308] [2020-11-07 06:49:58,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:49:58,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:49:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:49:58,329 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 10 states. [2020-11-07 06:49:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:49:59,353 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2020-11-07 06:49:59,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:49:59,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 06:49:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:49:59,356 INFO L225 Difference]: With dead ends: 114 [2020-11-07 06:49:59,356 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 06:49:59,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:49:59,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 06:49:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2020-11-07 06:49:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 06:49:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-11-07 06:49:59,409 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 63 [2020-11-07 06:49:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:49:59,410 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-11-07 06:49:59,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:49:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-11-07 06:49:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-07 06:49:59,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:49:59,412 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:49:59,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:49:59,412 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:49:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:49:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -780155513, now seen corresponding path program 1 times [2020-11-07 06:49:59,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:49:59,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1842089853] [2020-11-07 06:49:59,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:49:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:49:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:49:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:49:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:49:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:49:59,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1842089853] [2020-11-07 06:49:59,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:49:59,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:49:59,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807455723] [2020-11-07 06:49:59,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:49:59,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:49:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:49:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:49:59,600 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2020-11-07 06:50:00,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:00,059 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2020-11-07 06:50:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:00,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2020-11-07 06:50:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:00,062 INFO L225 Difference]: With dead ends: 113 [2020-11-07 06:50:00,063 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 06:50:00,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 06:50:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2020-11-07 06:50:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 06:50:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2020-11-07 06:50:00,106 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 64 [2020-11-07 06:50:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:00,106 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2020-11-07 06:50:00,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2020-11-07 06:50:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 06:50:00,107 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:00,107 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:00,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:50:00,108 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:00,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1468346093, now seen corresponding path program 1 times [2020-11-07 06:50:00,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:00,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122175476] [2020-11-07 06:50:00,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:00,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:00,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:00,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:00,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122175476] [2020-11-07 06:50:00,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:00,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:50:00,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825748390] [2020-11-07 06:50:00,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:50:00,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:50:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:50:00,623 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 10 states. [2020-11-07 06:50:03,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:03,804 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2020-11-07 06:50:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:03,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-11-07 06:50:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:03,806 INFO L225 Difference]: With dead ends: 112 [2020-11-07 06:50:03,806 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 06:50:03,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:50:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 06:50:03,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2020-11-07 06:50:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-07 06:50:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2020-11-07 06:50:03,840 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 65 [2020-11-07 06:50:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:03,841 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2020-11-07 06:50:03,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:50:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2020-11-07 06:50:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 06:50:03,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:03,842 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:03,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:50:03,842 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash -996355347, now seen corresponding path program 3 times [2020-11-07 06:50:03,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:03,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [427768985] [2020-11-07 06:50:03,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:03,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:04,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [427768985] [2020-11-07 06:50:04,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:04,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-11-07 06:50:04,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538923291] [2020-11-07 06:50:04,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:50:04,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:04,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:50:04,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:50:04,032 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2020-11-07 06:50:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:06,558 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2020-11-07 06:50:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:50:06,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-11-07 06:50:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:06,560 INFO L225 Difference]: With dead ends: 111 [2020-11-07 06:50:06,561 INFO L226 Difference]: Without dead ends: 86 [2020-11-07 06:50:06,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-11-07 06:50:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2020-11-07 06:50:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 06:50:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2020-11-07 06:50:06,598 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 66 [2020-11-07 06:50:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:06,599 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2020-11-07 06:50:06,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:50:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2020-11-07 06:50:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 06:50:06,600 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:06,600 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:06,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:50:06,600 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash -297362803, now seen corresponding path program 1 times [2020-11-07 06:50:06,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:06,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [47569502] [2020-11-07 06:50:06,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:07,193 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2020-11-07 06:50:07,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:07,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:07,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:50:07,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [47569502] [2020-11-07 06:50:07,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:07,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 06:50:07,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749094716] [2020-11-07 06:50:07,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 06:50:07,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 06:50:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:50:07,306 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 20 states. [2020-11-07 06:50:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:13,353 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2020-11-07 06:50:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 06:50:13,354 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2020-11-07 06:50:13,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:13,356 INFO L225 Difference]: With dead ends: 115 [2020-11-07 06:50:13,356 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 06:50:13,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 06:50:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 06:50:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2020-11-07 06:50:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-07 06:50:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-11-07 06:50:13,403 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 66 [2020-11-07 06:50:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:13,403 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-11-07 06:50:13,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 06:50:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-11-07 06:50:13,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 06:50:13,405 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:13,405 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:13,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:50:13,405 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:13,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:13,406 INFO L82 PathProgramCache]: Analyzing trace with hash 860266693, now seen corresponding path program 2 times [2020-11-07 06:50:13,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:13,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [602104112] [2020-11-07 06:50:13,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:13,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [602104112] [2020-11-07 06:50:13,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:13,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:50:13,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217777965] [2020-11-07 06:50:13,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:50:13,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:13,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:50:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:50:13,582 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 7 states. [2020-11-07 06:50:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:14,253 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-11-07 06:50:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:50:14,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2020-11-07 06:50:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:14,256 INFO L225 Difference]: With dead ends: 132 [2020-11-07 06:50:14,256 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 06:50:14,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 06:50:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2020-11-07 06:50:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-07 06:50:14,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2020-11-07 06:50:14,296 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 75 [2020-11-07 06:50:14,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:14,296 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2020-11-07 06:50:14,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:50:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2020-11-07 06:50:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-11-07 06:50:14,297 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:14,297 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:14,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:50:14,298 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1980117123, now seen corresponding path program 1 times [2020-11-07 06:50:14,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:14,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981199298] [2020-11-07 06:50:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:14,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981199298] [2020-11-07 06:50:14,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:14,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:50:14,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783214737] [2020-11-07 06:50:14,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:50:14,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:14,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:50:14,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:50:14,772 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 10 states. [2020-11-07 06:50:15,157 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:50:15,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:15,950 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2020-11-07 06:50:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:15,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-11-07 06:50:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:15,951 INFO L225 Difference]: With dead ends: 131 [2020-11-07 06:50:15,951 INFO L226 Difference]: Without dead ends: 106 [2020-11-07 06:50:15,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:50:15,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-07 06:50:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-11-07 06:50:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 06:50:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2020-11-07 06:50:15,997 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 76 [2020-11-07 06:50:15,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:15,997 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2020-11-07 06:50:15,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:50:15,997 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2020-11-07 06:50:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-11-07 06:50:15,998 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:15,998 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:15,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:50:15,999 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1192352587, now seen corresponding path program 1 times [2020-11-07 06:50:16,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:16,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648705618] [2020-11-07 06:50:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:16,208 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:16,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648705618] [2020-11-07 06:50:16,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:16,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:50:16,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058229704] [2020-11-07 06:50:16,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:50:16,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:16,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:50:16,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:50:16,214 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 7 states. [2020-11-07 06:50:25,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:25,311 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2020-11-07 06:50:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:50:25,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-11-07 06:50:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:25,313 INFO L225 Difference]: With dead ends: 147 [2020-11-07 06:50:25,314 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 06:50:25,314 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:50:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 06:50:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2020-11-07 06:50:25,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 06:50:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2020-11-07 06:50:25,377 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 77 [2020-11-07 06:50:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:25,378 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2020-11-07 06:50:25,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:50:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2020-11-07 06:50:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 06:50:25,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:25,380 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:25,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 06:50:25,380 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1784720579, now seen corresponding path program 1 times [2020-11-07 06:50:25,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:25,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [464565720] [2020-11-07 06:50:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:25,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:25,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:25,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:25,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:25,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [464565720] [2020-11-07 06:50:25,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:25,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:25,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408999029] [2020-11-07 06:50:25,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:25,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:25,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:25,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:25,977 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 11 states. [2020-11-07 06:50:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:29,272 INFO L93 Difference]: Finished difference Result 179 states and 217 transitions. [2020-11-07 06:50:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:50:29,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-11-07 06:50:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:29,274 INFO L225 Difference]: With dead ends: 179 [2020-11-07 06:50:29,274 INFO L226 Difference]: Without dead ends: 128 [2020-11-07 06:50:29,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:50:29,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-11-07 06:50:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2020-11-07 06:50:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 06:50:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2020-11-07 06:50:29,336 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 78 [2020-11-07 06:50:29,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:29,337 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2020-11-07 06:50:29,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:29,337 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2020-11-07 06:50:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-07 06:50:29,337 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:29,338 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:29,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 06:50:29,338 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:29,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:29,338 INFO L82 PathProgramCache]: Analyzing trace with hash 635318793, now seen corresponding path program 1 times [2020-11-07 06:50:29,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:29,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1220446967] [2020-11-07 06:50:29,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:30,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:30,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:30,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:30,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:50:30,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1220446967] [2020-11-07 06:50:30,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:30,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 06:50:30,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020971119] [2020-11-07 06:50:30,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 06:50:30,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 06:50:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:50:30,112 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand 22 states. [2020-11-07 06:50:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:32,768 INFO L93 Difference]: Finished difference Result 222 states and 276 transitions. [2020-11-07 06:50:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:50:32,769 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2020-11-07 06:50:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:32,771 INFO L225 Difference]: With dead ends: 222 [2020-11-07 06:50:32,771 INFO L226 Difference]: Without dead ends: 219 [2020-11-07 06:50:32,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 06:50:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-11-07 06:50:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2020-11-07 06:50:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-11-07 06:50:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 185 transitions. [2020-11-07 06:50:32,898 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 185 transitions. Word has length 80 [2020-11-07 06:50:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:32,899 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 185 transitions. [2020-11-07 06:50:32,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 06:50:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 185 transitions. [2020-11-07 06:50:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 06:50:32,900 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:32,900 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:32,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-07 06:50:32,900 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:32,901 INFO L82 PathProgramCache]: Analyzing trace with hash 987477193, now seen corresponding path program 2 times [2020-11-07 06:50:32,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:32,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617574406] [2020-11-07 06:50:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:33,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:33,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:33,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:33,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:33,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:50:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 48 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:50:33,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617574406] [2020-11-07 06:50:33,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:33,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:50:33,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240654622] [2020-11-07 06:50:33,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:50:33,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:50:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:50:33,106 INFO L87 Difference]: Start difference. First operand 155 states and 185 transitions. Second operand 8 states. [2020-11-07 06:50:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:34,130 INFO L93 Difference]: Finished difference Result 231 states and 286 transitions. [2020-11-07 06:50:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:50:34,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-11-07 06:50:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:34,133 INFO L225 Difference]: With dead ends: 231 [2020-11-07 06:50:34,133 INFO L226 Difference]: Without dead ends: 147 [2020-11-07 06:50:34,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:50:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-11-07 06:50:34,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2020-11-07 06:50:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-11-07 06:50:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2020-11-07 06:50:34,227 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 89 [2020-11-07 06:50:34,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:34,228 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2020-11-07 06:50:34,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:50:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2020-11-07 06:50:34,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 06:50:34,229 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:34,229 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:34,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-07 06:50:34,229 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:34,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1963408377, now seen corresponding path program 1 times [2020-11-07 06:50:34,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:34,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592384222] [2020-11-07 06:50:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:34,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:34,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:34,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:34,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:34,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:50:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:50:34,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592384222] [2020-11-07 06:50:34,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:34,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 06:50:34,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8129341] [2020-11-07 06:50:34,763 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:34,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:34,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:34,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:34,764 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand 11 states. [2020-11-07 06:50:36,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:36,224 INFO L93 Difference]: Finished difference Result 197 states and 238 transitions. [2020-11-07 06:50:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:50:36,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2020-11-07 06:50:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:36,225 INFO L225 Difference]: With dead ends: 197 [2020-11-07 06:50:36,226 INFO L226 Difference]: Without dead ends: 146 [2020-11-07 06:50:36,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:50:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-11-07 06:50:36,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2020-11-07 06:50:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2020-11-07 06:50:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 152 transitions. [2020-11-07 06:50:36,295 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 152 transitions. Word has length 90 [2020-11-07 06:50:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:36,295 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 152 transitions. [2020-11-07 06:50:36,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 152 transitions. [2020-11-07 06:50:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-11-07 06:50:36,296 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:36,296 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:50:36,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-07 06:50:36,297 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:36,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1112408497, now seen corresponding path program 1 times [2020-11-07 06:50:36,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:36,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [858410679] [2020-11-07 06:50:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:40,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:40,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:50:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:40,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:50:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:40,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:50:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:40,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:50:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:50:40,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [858410679] [2020-11-07 06:50:40,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:40,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:50:40,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612024855] [2020-11-07 06:50:40,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:50:40,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:50:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:50:40,799 INFO L87 Difference]: Start difference. First operand 134 states and 152 transitions. Second operand 9 states. [2020-11-07 06:51:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:02,808 INFO L93 Difference]: Finished difference Result 188 states and 225 transitions. [2020-11-07 06:51:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:51:02,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2020-11-07 06:51:02,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:02,810 INFO L225 Difference]: With dead ends: 188 [2020-11-07 06:51:02,810 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 06:51:02,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:51:02,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 06:51:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2020-11-07 06:51:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-11-07 06:51:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 153 transitions. [2020-11-07 06:51:02,904 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 153 transitions. Word has length 91 [2020-11-07 06:51:02,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:02,905 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 153 transitions. [2020-11-07 06:51:02,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:51:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 153 transitions. [2020-11-07 06:51:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-07 06:51:02,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:02,906 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:02,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-07 06:51:02,906 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -943396289, now seen corresponding path program 1 times [2020-11-07 06:51:02,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:02,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1483911960] [2020-11-07 06:51:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:03,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:03,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:03,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:03,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:51:03,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1483911960] [2020-11-07 06:51:03,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:03,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:51:03,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990916617] [2020-11-07 06:51:03,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:51:03,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:03,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:51:03,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:51:03,621 INFO L87 Difference]: Start difference. First operand 135 states and 153 transitions. Second operand 12 states. [2020-11-07 06:51:04,074 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:51:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:05,395 INFO L93 Difference]: Finished difference Result 190 states and 228 transitions. [2020-11-07 06:51:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:51:05,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2020-11-07 06:51:05,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:05,398 INFO L225 Difference]: With dead ends: 190 [2020-11-07 06:51:05,398 INFO L226 Difference]: Without dead ends: 139 [2020-11-07 06:51:05,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:51:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-11-07 06:51:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2020-11-07 06:51:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 06:51:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 155 transitions. [2020-11-07 06:51:05,507 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 155 transitions. Word has length 92 [2020-11-07 06:51:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:05,508 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 155 transitions. [2020-11-07 06:51:05,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:51:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 155 transitions. [2020-11-07 06:51:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-11-07 06:51:05,509 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:05,509 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:05,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-07 06:51:05,510 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1031069653, now seen corresponding path program 1 times [2020-11-07 06:51:05,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:05,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1883315855] [2020-11-07 06:51:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:06,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:06,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:06,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:06,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:06,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:51:06,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1883315855] [2020-11-07 06:51:06,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:06,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 06:51:06,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415501897] [2020-11-07 06:51:06,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 06:51:06,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:06,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 06:51:06,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:51:06,442 INFO L87 Difference]: Start difference. First operand 137 states and 155 transitions. Second operand 24 states. [2020-11-07 06:51:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:09,012 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2020-11-07 06:51:09,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 06:51:09,013 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2020-11-07 06:51:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:09,014 INFO L225 Difference]: With dead ends: 159 [2020-11-07 06:51:09,014 INFO L226 Difference]: Without dead ends: 156 [2020-11-07 06:51:09,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=364, Invalid=1706, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 06:51:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-07 06:51:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2020-11-07 06:51:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-07 06:51:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2020-11-07 06:51:09,087 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 93 [2020-11-07 06:51:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:09,087 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2020-11-07 06:51:09,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 06:51:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2020-11-07 06:51:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-07 06:51:09,093 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:09,093 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:09,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-07 06:51:09,093 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:09,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1138222395, now seen corresponding path program 1 times [2020-11-07 06:51:09,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:09,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1253947502] [2020-11-07 06:51:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 20 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:51:09,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1253947502] [2020-11-07 06:51:09,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:09,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:51:09,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4307408] [2020-11-07 06:51:09,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:51:09,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:51:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:51:09,877 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand 12 states. [2020-11-07 06:51:10,297 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:51:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:11,580 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2020-11-07 06:51:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:51:11,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2020-11-07 06:51:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:11,582 INFO L225 Difference]: With dead ends: 207 [2020-11-07 06:51:11,583 INFO L226 Difference]: Without dead ends: 156 [2020-11-07 06:51:11,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:51:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-11-07 06:51:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2020-11-07 06:51:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-11-07 06:51:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 165 transitions. [2020-11-07 06:51:11,667 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 165 transitions. Word has length 103 [2020-11-07 06:51:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:11,667 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 165 transitions. [2020-11-07 06:51:11,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:51:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 165 transitions. [2020-11-07 06:51:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 06:51:11,668 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:11,669 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:11,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-07 06:51:11,669 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash -903264757, now seen corresponding path program 1 times [2020-11-07 06:51:11,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:11,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1155376470] [2020-11-07 06:51:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:51:12,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1155376470] [2020-11-07 06:51:12,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:12,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-11-07 06:51:12,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409849228] [2020-11-07 06:51:12,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 06:51:12,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 06:51:12,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:51:12,758 INFO L87 Difference]: Start difference. First operand 147 states and 165 transitions. Second operand 26 states. [2020-11-07 06:51:22,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:22,086 INFO L93 Difference]: Finished difference Result 242 states and 297 transitions. [2020-11-07 06:51:22,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:51:22,087 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2020-11-07 06:51:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:22,089 INFO L225 Difference]: With dead ends: 242 [2020-11-07 06:51:22,089 INFO L226 Difference]: Without dead ends: 239 [2020-11-07 06:51:22,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2020-11-07 06:51:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-11-07 06:51:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 196. [2020-11-07 06:51:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-11-07 06:51:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 235 transitions. [2020-11-07 06:51:22,240 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 235 transitions. Word has length 105 [2020-11-07 06:51:22,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:22,240 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 235 transitions. [2020-11-07 06:51:22,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 06:51:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 235 transitions. [2020-11-07 06:51:22,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-07 06:51:22,241 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:22,242 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:22,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-07 06:51:22,242 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:22,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:22,243 INFO L82 PathProgramCache]: Analyzing trace with hash -530971897, now seen corresponding path program 2 times [2020-11-07 06:51:22,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:22,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126868713] [2020-11-07 06:51:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,481 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-07 06:51:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 25 proven. 112 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:51:22,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126868713] [2020-11-07 06:51:22,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:22,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:51:22,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209719988] [2020-11-07 06:51:22,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:51:22,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:51:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:51:22,518 INFO L87 Difference]: Start difference. First operand 196 states and 235 transitions. Second operand 10 states. [2020-11-07 06:51:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:23,872 INFO L93 Difference]: Finished difference Result 270 states and 334 transitions. [2020-11-07 06:51:23,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:51:23,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2020-11-07 06:51:23,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:23,875 INFO L225 Difference]: With dead ends: 270 [2020-11-07 06:51:23,875 INFO L226 Difference]: Without dead ends: 170 [2020-11-07 06:51:23,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:51:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2020-11-07 06:51:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2020-11-07 06:51:23,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-11-07 06:51:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 182 transitions. [2020-11-07 06:51:23,994 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 182 transitions. Word has length 114 [2020-11-07 06:51:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:23,995 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 182 transitions. [2020-11-07 06:51:23,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:51:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 182 transitions. [2020-11-07 06:51:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-11-07 06:51:23,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:23,996 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:23,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-11-07 06:51:23,997 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:23,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash 2136126843, now seen corresponding path program 1 times [2020-11-07 06:51:23,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:23,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1999122724] [2020-11-07 06:51:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-07 06:51:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:51:24,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1999122724] [2020-11-07 06:51:24,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:24,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:51:24,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725521126] [2020-11-07 06:51:24,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:51:24,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:24,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:51:24,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:51:24,807 INFO L87 Difference]: Start difference. First operand 162 states and 182 transitions. Second operand 13 states. [2020-11-07 06:51:25,251 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2020-11-07 06:51:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:26,772 INFO L93 Difference]: Finished difference Result 215 states and 253 transitions. [2020-11-07 06:51:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:51:26,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2020-11-07 06:51:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:26,774 INFO L225 Difference]: With dead ends: 215 [2020-11-07 06:51:26,774 INFO L226 Difference]: Without dead ends: 162 [2020-11-07 06:51:26,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:51:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-11-07 06:51:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2020-11-07 06:51:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-11-07 06:51:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 178 transitions. [2020-11-07 06:51:26,874 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 178 transitions. Word has length 115 [2020-11-07 06:51:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:26,875 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 178 transitions. [2020-11-07 06:51:26,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:51:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2020-11-07 06:51:26,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-07 06:51:26,876 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:26,877 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:26,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-11-07 06:51:26,877 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:26,877 INFO L82 PathProgramCache]: Analyzing trace with hash -53103347, now seen corresponding path program 1 times [2020-11-07 06:51:26,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:26,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281591182] [2020-11-07 06:51:26,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:27,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-07 06:51:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 12 proven. 134 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:51:28,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281591182] [2020-11-07 06:51:28,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:28,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 06:51:28,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114046288] [2020-11-07 06:51:28,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 06:51:28,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:28,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 06:51:28,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:51:28,076 INFO L87 Difference]: Start difference. First operand 160 states and 178 transitions. Second operand 28 states. [2020-11-07 06:51:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:31,401 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2020-11-07 06:51:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-07 06:51:31,402 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 116 [2020-11-07 06:51:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:31,404 INFO L225 Difference]: With dead ends: 182 [2020-11-07 06:51:31,404 INFO L226 Difference]: Without dead ends: 179 [2020-11-07 06:51:31,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=460, Invalid=2402, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 06:51:31,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-11-07 06:51:31,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2020-11-07 06:51:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-11-07 06:51:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 185 transitions. [2020-11-07 06:51:31,528 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 185 transitions. Word has length 116 [2020-11-07 06:51:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:31,528 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 185 transitions. [2020-11-07 06:51:31,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 06:51:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 185 transitions. [2020-11-07 06:51:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-07 06:51:31,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:31,530 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:31,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-11-07 06:51:31,530 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1639331331, now seen corresponding path program 1 times [2020-11-07 06:51:31,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:31,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705617741] [2020-11-07 06:51:31,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-07 06:51:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:51:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 14 proven. 168 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:51:32,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705617741] [2020-11-07 06:51:32,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:32,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-11-07 06:51:32,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615771206] [2020-11-07 06:51:32,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-11-07 06:51:32,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-11-07 06:51:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2020-11-07 06:51:32,866 INFO L87 Difference]: Start difference. First operand 167 states and 185 transitions. Second operand 30 states. [2020-11-07 06:51:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:38,411 INFO L93 Difference]: Finished difference Result 231 states and 272 transitions. [2020-11-07 06:51:38,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-11-07 06:51:38,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2020-11-07 06:51:38,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:38,413 INFO L225 Difference]: With dead ends: 231 [2020-11-07 06:51:38,414 INFO L226 Difference]: Without dead ends: 228 [2020-11-07 06:51:38,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=517, Invalid=2789, Unknown=0, NotChecked=0, Total=3306 [2020-11-07 06:51:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-11-07 06:51:38,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 221. [2020-11-07 06:51:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-11-07 06:51:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 260 transitions. [2020-11-07 06:51:38,534 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 260 transitions. Word has length 126 [2020-11-07 06:51:38,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:38,535 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 260 transitions. [2020-11-07 06:51:38,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-11-07 06:51:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 260 transitions. [2020-11-07 06:51:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 06:51:38,536 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:51:38,536 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 7, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 06:51:38,536 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-11-07 06:51:38,537 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:51:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:51:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 847892309, now seen corresponding path program 2 times [2020-11-07 06:51:38,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:51:38,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [320212322] [2020-11-07 06:51:38,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:51:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:51:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-11-07 06:51:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:51:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-11-07 06:51:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-11-07 06:51:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-11-07 06:51:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-11-07 06:51:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:51:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:39,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-11-07 06:51:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:51:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 16 proven. 200 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-11-07 06:51:40,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [320212322] [2020-11-07 06:51:40,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:51:40,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-11-07 06:51:40,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767413787] [2020-11-07 06:51:40,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-07 06:51:40,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:51:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-07 06:51:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2020-11-07 06:51:40,023 INFO L87 Difference]: Start difference. First operand 221 states and 260 transitions. Second operand 31 states. [2020-11-07 06:51:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:51:43,524 INFO L93 Difference]: Finished difference Result 221 states and 260 transitions. [2020-11-07 06:51:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 06:51:43,525 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 135 [2020-11-07 06:51:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:51:43,526 INFO L225 Difference]: With dead ends: 221 [2020-11-07 06:51:43,526 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:51:43,527 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=532, Invalid=2774, Unknown=0, NotChecked=0, Total=3306 [2020-11-07 06:51:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:51:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:51:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:51:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:51:43,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2020-11-07 06:51:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:51:43,528 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:51:43,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-07 06:51:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:51:43,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:51:43,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-11-07 06:51:43,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:51:43,946 WARN L194 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 308 [2020-11-07 06:51:44,387 WARN L194 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 174 [2020-11-07 06:51:44,782 WARN L194 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 325 [2020-11-07 06:51:45,274 WARN L194 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 303 [2020-11-07 06:51:45,396 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 341 DAG size of output: 319 [2020-11-07 06:51:46,063 WARN L194 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 256 [2020-11-07 06:51:46,278 WARN L194 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 59 [2020-11-07 06:51:46,602 WARN L194 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 152 [2020-11-07 06:51:46,839 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 372 DAG size of output: 320 [2020-11-07 06:51:47,224 WARN L194 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 158 [2020-11-07 06:51:47,454 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 380 DAG size of output: 302 [2020-11-07 06:51:47,810 WARN L194 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 187 [2020-11-07 06:51:48,316 WARN L194 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 372 DAG size of output: 281 [2020-11-07 06:51:48,691 WARN L194 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 227 [2020-11-07 06:51:49,155 WARN L194 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 250 [2020-11-07 06:51:49,301 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 74 [2020-11-07 06:51:49,502 WARN L194 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 132 [2020-11-07 06:51:49,642 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 25 [2020-11-07 06:51:49,939 WARN L194 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 20 [2020-11-07 06:51:52,405 WARN L194 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 163 DAG size of output: 45 [2020-11-07 06:51:52,516 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2020-11-07 06:51:52,618 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2020-11-07 06:51:53,056 WARN L194 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 20 [2020-11-07 06:51:53,900 WARN L194 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 37 [2020-11-07 06:51:54,207 WARN L194 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 20 [2020-11-07 06:51:58,896 WARN L194 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 241 DAG size of output: 37 [2020-11-07 06:51:59,147 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-11-07 06:51:59,290 WARN L194 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-11-07 06:51:59,418 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-11-07 06:52:02,192 WARN L194 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 139 DAG size of output: 37 [2020-11-07 06:52:02,504 WARN L194 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 303 DAG size of output: 20 [2020-11-07 06:52:02,985 WARN L194 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 37 [2020-11-07 06:52:05,251 WARN L194 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 288 DAG size of output: 20 [2020-11-07 06:52:12,013 WARN L194 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 173 DAG size of output: 28 [2020-11-07 06:52:12,233 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 27 [2020-11-07 06:52:12,978 WARN L194 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 37 [2020-11-07 06:52:13,177 WARN L194 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 22 [2020-11-07 06:52:13,305 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 27 [2020-11-07 06:52:14,557 WARN L194 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 235 DAG size of output: 37 [2020-11-07 06:52:14,862 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 20 [2020-11-07 06:52:17,606 WARN L194 SmtUtils]: Spent 2.72 s on a formula simplification. DAG size of input: 122 DAG size of output: 45 [2020-11-07 06:52:17,610 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,611 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,611 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,611 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,612 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,612 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,612 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:52:17,612 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,612 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:52:17,612 INFO L269 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,613 INFO L262 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:52:17,613 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)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#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-07 06:52:17,613 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,613 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 06:52:17,613 INFO L262 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:52:17,614 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:52:17,614 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-11-07 06:52:17,614 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:52:17,614 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:52:17,614 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:52:17,614 INFO L266 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-11-07 06:52:17,614 INFO L266 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-11-07 06:52:17,614 INFO L266 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:52:17,614 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-11-07 06:52:17,614 INFO L262 CegarLoopResult]: At program point L35-2(lines 23 38) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0)) (.cse0 (+ main_~l~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,615 INFO L262 CegarLoopResult]: At program point L31(lines 31 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,615 INFO L262 CegarLoopResult]: At program point L27(lines 27 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,615 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 16 43) the Hoare annotation is: true [2020-11-07 06:52:17,615 INFO L262 CegarLoopResult]: At program point L23(lines 23 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,615 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,615 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,616 INFO L262 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,616 INFO L262 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,616 INFO L262 CegarLoopResult]: At program point L40-1(lines 21 41) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,616 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,616 INFO L262 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,617 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,617 INFO L262 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,617 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,617 INFO L262 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,617 INFO L262 CegarLoopResult]: At program point L33(lines 33 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,617 INFO L262 CegarLoopResult]: At program point L29(lines 29 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,618 INFO L262 CegarLoopResult]: At program point L25(lines 25 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,618 INFO L269 CegarLoopResult]: At program point L21-2(lines 21 41) the Hoare annotation is: true [2020-11-07 06:52:17,618 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 06:52:17,618 INFO L262 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (= main_~i~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,618 INFO L262 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,618 INFO L262 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,618 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 16 43) the Hoare annotation is: true [2020-11-07 06:52:17,619 INFO L262 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 1)) 2)) 1)) (<= main_~l~0 .cse0) (<= .cse0 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,619 INFO L262 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,619 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,619 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 16 43) the Hoare annotation is: true [2020-11-07 06:52:17,619 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-11-07 06:52:17,619 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,620 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,620 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,620 INFO L262 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,620 INFO L262 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,620 INFO L262 CegarLoopResult]: At program point L35(lines 35 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,620 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-11-07 06:52:17,620 INFO L262 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-11-07 06:52:17,621 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,621 INFO L262 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,621 INFO L262 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-11-07 06:52:17,621 INFO L262 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-11-07 06:52:17,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:52:17 BoogieIcfgContainer [2020-11-07 06:52:17,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:52:17,649 INFO L168 Benchmark]: Toolchain (without parser) took 164261.90 ms. Allocated memory was 161.5 MB in the beginning and 280.0 MB in the end (delta: 118.5 MB). Free memory was 118.1 MB in the beginning and 167.4 MB in the end (delta: -49.4 MB). Peak memory consumption was 148.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:17,650 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 161.5 MB. Free memory was 134.4 MB in the beginning and 134.3 MB in the end (delta: 128.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:52:17,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.43 ms. Allocated memory is still 161.5 MB. Free memory was 145.7 MB in the beginning and 135.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:17,651 INFO L168 Benchmark]: Boogie Preprocessor took 88.44 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 145.0 MB in the end (delta: -9.7 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:17,651 INFO L168 Benchmark]: RCFGBuilder took 602.05 ms. Allocated memory is still 161.5 MB. Free memory was 145.0 MB in the beginning and 127.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:17,651 INFO L168 Benchmark]: TraceAbstraction took 163224.97 ms. Allocated memory was 161.5 MB in the beginning and 280.0 MB in the end (delta: 118.5 MB). Free memory was 126.6 MB in the beginning and 167.4 MB in the end (delta: -40.8 MB). Peak memory consumption was 157.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:52:17,655 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.27 ms. Allocated memory is still 161.5 MB. Free memory was 134.4 MB in the beginning and 134.3 MB in the end (delta: 128.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 306.43 ms. Allocated memory is still 161.5 MB. Free memory was 145.7 MB in the beginning and 135.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 88.44 ms. Allocated memory is still 161.5 MB. Free memory was 135.4 MB in the beginning and 145.0 MB in the end (delta: -9.7 MB). Peak memory consumption was 3.6 MB. Max. memory is 8.0 GB. * RCFGBuilder took 602.05 ms. Allocated memory is still 161.5 MB. Free memory was 145.0 MB in the beginning and 127.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 163224.97 ms. Allocated memory was 161.5 MB in the beginning and 280.0 MB in the end (delta: 118.5 MB). Free memory was 126.6 MB in the beginning and 167.4 MB in the end (delta: -40.8 MB). Peak memory consumption was 157.0 MB. 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: 21]: Loop Invariant Derived loop invariant: (!(SIZE <= 20000001) || !(20000001 <= SIZE)) || (l <= i + j + k + v1 + v2 + v3 + v4 + v5 && i + j + k + v1 + v2 + v3 + v4 + v5 <= l) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || !(SIZE <= 20000001)) || !(cond == 0)) || !(20000001 <= SIZE) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 129.0s, OverallIterations: 34, TraceHistogramMax: 9, AutomataDifference: 103.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 34.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1434 SDtfs, 5982 SDslu, 3124 SDs, 0 SdLazy, 11823 SolverSat, 1164 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 66.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 996 GetRequests, 314 SyntacticMatches, 18 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5260 ImplicationChecksByTransitivity, 45.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 466 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 595 PreInvPairs, 798 NumberOfFragments, 1480 HoareAnnotationTreeSize, 595 FomulaSimplifications, 52961144770 FormulaSimplificationTreeSizeReduction, 5.9s HoareSimplificationTime, 61 FomulaSimplificationsInter, 115943 FormulaSimplificationTreeSizeReductionInter, 28.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2585 NumberOfCodeBlocks, 2585 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2551 ConstructedInterpolants, 0 QuantifiedInterpolants, 2631365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 1011/2463 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...