/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/ldv-regression/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 01:05:04,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 01:05:04,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 01:05:04,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 01:05:04,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 01:05:04,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 01:05:04,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 01:05:04,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 01:05:04,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 01:05:04,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 01:05:04,804 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 01:05:04,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 01:05:04,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 01:05:04,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 01:05:04,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 01:05:04,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 01:05:04,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 01:05:04,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 01:05:04,841 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 01:05:04,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 01:05:04,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 01:05:04,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 01:05:04,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 01:05:04,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 01:05:04,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 01:05:04,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 01:05:04,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 01:05:04,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 01:05:04,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 01:05:04,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 01:05:04,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 01:05:04,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 01:05:04,878 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 01:05:04,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 01:05:04,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 01:05:04,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 01:05:04,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 01:05:04,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 01:05:04,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 01:05:04,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 01:05:04,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 01:05:04,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 01:05:04,911 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 01:05:04,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 01:05:04,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 01:05:04,918 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 01:05:04,918 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 01:05:04,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 01:05:04,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 01:05:04,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 01:05:04,919 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 01:05:04,919 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 01:05:04,920 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 01:05:04,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 01:05:04,921 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 01:05:04,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 01:05:04,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 01:05:04,922 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 01:05:04,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 01:05:04,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 01:05:04,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:05:04,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 01:05:04,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 01:05:04,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 01:05:04,923 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-10-24 01:05:05,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 01:05:05,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 01:05:05,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 01:05:05,411 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 01:05:05,412 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 01:05:05,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2020-10-24 01:05:05,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeda8352/c5251a9c1e7946ba8cd5c49fd2463987/FLAG875f9c150 [2020-10-24 01:05:06,162 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 01:05:06,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2020-10-24 01:05:06,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeda8352/c5251a9c1e7946ba8cd5c49fd2463987/FLAG875f9c150 [2020-10-24 01:05:06,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beeda8352/c5251a9c1e7946ba8cd5c49fd2463987 [2020-10-24 01:05:06,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 01:05:06,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 01:05:06,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 01:05:06,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 01:05:06,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 01:05:06,528 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be0b4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06, skipping insertion in model container [2020-10-24 01:05:06,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 01:05:06,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 01:05:06,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:05:06,748 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 01:05:06,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 01:05:06,794 INFO L208 MainTranslator]: Completed translation [2020-10-24 01:05:06,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06 WrapperNode [2020-10-24 01:05:06,795 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 01:05:06,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 01:05:06,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 01:05:06,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 01:05:06,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... [2020-10-24 01:05:06,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 01:05:06,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 01:05:06,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 01:05:06,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 01:05:06,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 01:05:06,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 01:05:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 01:05:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 01:05:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-10-24 01:05:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 01:05:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 01:05:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 01:05:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 01:05:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 01:05:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 01:05:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-10-24 01:05:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-24 01:05:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 01:05:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 01:05:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 01:05:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-24 01:05:06,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 01:05:06,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 01:05:06,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 01:05:06,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 01:05:07,518 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 01:05:07,519 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-24 01:05:07,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:05:07 BoogieIcfgContainer [2020-10-24 01:05:07,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 01:05:07,523 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 01:05:07,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 01:05:07,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 01:05:07,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:05:06" (1/3) ... [2020-10-24 01:05:07,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37860165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:05:07, skipping insertion in model container [2020-10-24 01:05:07,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:06" (2/3) ... [2020-10-24 01:05:07,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37860165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:05:07, skipping insertion in model container [2020-10-24 01:05:07,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:05:07" (3/3) ... [2020-10-24 01:05:07,531 INFO L111 eAbstractionObserver]: Analyzing ICFG test25-2.c [2020-10-24 01:05:07,543 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 01:05:07,550 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 01:05:07,567 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 01:05:07,595 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 01:05:07,596 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 01:05:07,596 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 01:05:07,596 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 01:05:07,596 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 01:05:07,597 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 01:05:07,597 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 01:05:07,597 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 01:05:07,617 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2020-10-24 01:05:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-24 01:05:07,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:07,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:05:07,633 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1065751138, now seen corresponding path program 1 times [2020-10-24 01:05:07,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:07,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [459343457] [2020-10-24 01:05:07,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:07,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:08,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-10-24 01:05:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:08,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [459343457] [2020-10-24 01:05:08,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 01:05:08,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 01:05:08,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726311229] [2020-10-24 01:05:08,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 01:05:08,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:08,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 01:05:08,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:05:08,104 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2020-10-24 01:05:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:08,408 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-10-24 01:05:08,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 01:05:08,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-24 01:05:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:08,420 INFO L225 Difference]: With dead ends: 143 [2020-10-24 01:05:08,420 INFO L226 Difference]: Without dead ends: 75 [2020-10-24 01:05:08,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 01:05:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-24 01:05:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2020-10-24 01:05:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 01:05:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 01:05:08,482 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 50 [2020-10-24 01:05:08,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:08,483 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 01:05:08,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 01:05:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 01:05:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 01:05:08,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:08,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:08,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 01:05:08,488 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:08,489 INFO L82 PathProgramCache]: Analyzing trace with hash 8480307, now seen corresponding path program 1 times [2020-10-24 01:05:08,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:08,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200293338] [2020-10-24 01:05:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:08,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:08,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-10-24 01:05:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:08,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200293338] [2020-10-24 01:05:08,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:08,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 01:05:08,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469418928] [2020-10-24 01:05:08,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 01:05:08,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 01:05:08,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-24 01:05:08,704 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 6 states. [2020-10-24 01:05:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:08,923 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2020-10-24 01:05:08,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 01:05:08,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2020-10-24 01:05:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:08,926 INFO L225 Difference]: With dead ends: 121 [2020-10-24 01:05:08,926 INFO L226 Difference]: Without dead ends: 85 [2020-10-24 01:05:08,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-24 01:05:08,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-24 01:05:08,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2020-10-24 01:05:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 01:05:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-24 01:05:08,944 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2020-10-24 01:05:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:08,944 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-24 01:05:08,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 01:05:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-24 01:05:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-10-24 01:05:08,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:08,947 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:05:08,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 01:05:08,948 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:08,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1768479399, now seen corresponding path program 2 times [2020-10-24 01:05:08,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:08,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [5446034] [2020-10-24 01:05:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:09,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:09,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-24 01:05:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:09,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [5446034] [2020-10-24 01:05:09,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:09,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 01:05:09,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672595677] [2020-10-24 01:05:09,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 01:05:09,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:09,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 01:05:09,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-24 01:05:09,231 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 8 states. [2020-10-24 01:05:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:09,641 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2020-10-24 01:05:09,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 01:05:09,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2020-10-24 01:05:09,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:09,646 INFO L225 Difference]: With dead ends: 131 [2020-10-24 01:05:09,647 INFO L226 Difference]: Without dead ends: 95 [2020-10-24 01:05:09,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-24 01:05:09,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-24 01:05:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2020-10-24 01:05:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 01:05:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-24 01:05:09,684 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 72 [2020-10-24 01:05:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:09,687 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-24 01:05:09,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 01:05:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-24 01:05:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-24 01:05:09,693 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:09,694 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:09,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 01:05:09,694 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:09,695 INFO L82 PathProgramCache]: Analyzing trace with hash 297577727, now seen corresponding path program 3 times [2020-10-24 01:05:09,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:09,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088188141] [2020-10-24 01:05:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:09,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:09,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2020-10-24 01:05:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:09,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088188141] [2020-10-24 01:05:09,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:09,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 01:05:09,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807525793] [2020-10-24 01:05:09,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 01:05:09,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 01:05:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-24 01:05:09,946 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 10 states. [2020-10-24 01:05:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:10,291 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2020-10-24 01:05:10,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 01:05:10,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-10-24 01:05:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:10,294 INFO L225 Difference]: With dead ends: 141 [2020-10-24 01:05:10,294 INFO L226 Difference]: Without dead ends: 105 [2020-10-24 01:05:10,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-10-24 01:05:10,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-24 01:05:10,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2020-10-24 01:05:10,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-24 01:05:10,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-24 01:05:10,309 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 82 [2020-10-24 01:05:10,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:10,310 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-24 01:05:10,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 01:05:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-24 01:05:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-24 01:05:10,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:10,312 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:10,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 01:05:10,312 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:10,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:10,313 INFO L82 PathProgramCache]: Analyzing trace with hash -919511771, now seen corresponding path program 4 times [2020-10-24 01:05:10,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:10,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [418616993] [2020-10-24 01:05:10,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:10,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:10,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-10-24 01:05:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:10,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [418616993] [2020-10-24 01:05:10,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:10,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 01:05:10,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903459388] [2020-10-24 01:05:10,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 01:05:10,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:10,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 01:05:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-24 01:05:10,566 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 12 states. [2020-10-24 01:05:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:11,019 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2020-10-24 01:05:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 01:05:11,021 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2020-10-24 01:05:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:11,023 INFO L225 Difference]: With dead ends: 151 [2020-10-24 01:05:11,023 INFO L226 Difference]: Without dead ends: 115 [2020-10-24 01:05:11,024 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2020-10-24 01:05:11,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-10-24 01:05:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2020-10-24 01:05:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-24 01:05:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-10-24 01:05:11,039 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 92 [2020-10-24 01:05:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:11,040 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-10-24 01:05:11,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 01:05:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-10-24 01:05:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-24 01:05:11,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:11,042 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:11,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 01:05:11,042 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 343709131, now seen corresponding path program 5 times [2020-10-24 01:05:11,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:11,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959267835] [2020-10-24 01:05:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:11,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:11,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-10-24 01:05:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:11,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959267835] [2020-10-24 01:05:11,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:11,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 01:05:11,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131174369] [2020-10-24 01:05:11,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 01:05:11,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:11,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 01:05:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-10-24 01:05:11,397 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 14 states. [2020-10-24 01:05:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:11,803 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2020-10-24 01:05:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 01:05:11,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2020-10-24 01:05:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:11,806 INFO L225 Difference]: With dead ends: 161 [2020-10-24 01:05:11,806 INFO L226 Difference]: Without dead ends: 125 [2020-10-24 01:05:11,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2020-10-24 01:05:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-24 01:05:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2020-10-24 01:05:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-10-24 01:05:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-10-24 01:05:11,843 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 102 [2020-10-24 01:05:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:11,844 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-10-24 01:05:11,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 01:05:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-10-24 01:05:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2020-10-24 01:05:11,845 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:11,845 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:11,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 01:05:11,846 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:11,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:11,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1855080719, now seen corresponding path program 6 times [2020-10-24 01:05:11,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:11,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [184081857] [2020-10-24 01:05:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:12,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:12,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2020-10-24 01:05:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:12,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [184081857] [2020-10-24 01:05:12,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:12,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 01:05:12,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643585264] [2020-10-24 01:05:12,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 01:05:12,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 01:05:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-10-24 01:05:12,163 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 16 states. [2020-10-24 01:05:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:12,697 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2020-10-24 01:05:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 01:05:12,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 112 [2020-10-24 01:05:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:12,699 INFO L225 Difference]: With dead ends: 171 [2020-10-24 01:05:12,699 INFO L226 Difference]: Without dead ends: 135 [2020-10-24 01:05:12,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2020-10-24 01:05:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-10-24 01:05:12,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2020-10-24 01:05:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-24 01:05:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-10-24 01:05:12,732 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 112 [2020-10-24 01:05:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:12,733 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-10-24 01:05:12,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 01:05:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-10-24 01:05:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-10-24 01:05:12,735 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:12,735 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:12,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 01:05:12,736 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash -367255401, now seen corresponding path program 7 times [2020-10-24 01:05:12,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:12,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1118797614] [2020-10-24 01:05:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:13,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:13,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2020-10-24 01:05:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:13,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1118797614] [2020-10-24 01:05:13,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:13,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 01:05:13,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10263648] [2020-10-24 01:05:13,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 01:05:13,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 01:05:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2020-10-24 01:05:13,146 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 18 states. [2020-10-24 01:05:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:13,838 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2020-10-24 01:05:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 01:05:13,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 122 [2020-10-24 01:05:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:13,842 INFO L225 Difference]: With dead ends: 181 [2020-10-24 01:05:13,842 INFO L226 Difference]: Without dead ends: 145 [2020-10-24 01:05:13,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2020-10-24 01:05:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-24 01:05:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 137. [2020-10-24 01:05:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-24 01:05:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2020-10-24 01:05:13,867 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 122 [2020-10-24 01:05:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:13,869 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2020-10-24 01:05:13,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 01:05:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2020-10-24 01:05:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-10-24 01:05:13,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:13,878 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:13,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 01:05:13,879 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:13,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:13,880 INFO L82 PathProgramCache]: Analyzing trace with hash 451359421, now seen corresponding path program 8 times [2020-10-24 01:05:13,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:13,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [111432107] [2020-10-24 01:05:13,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:14,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:14,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-10-24 01:05:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:14,345 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:14,346 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [111432107] [2020-10-24 01:05:14,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:14,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 01:05:14,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070918378] [2020-10-24 01:05:14,347 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 01:05:14,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:14,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 01:05:14,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2020-10-24 01:05:14,349 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 20 states. [2020-10-24 01:05:15,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:15,107 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2020-10-24 01:05:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-24 01:05:15,110 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 132 [2020-10-24 01:05:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:15,115 INFO L225 Difference]: With dead ends: 191 [2020-10-24 01:05:15,115 INFO L226 Difference]: Without dead ends: 155 [2020-10-24 01:05:15,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=405, Invalid=855, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 01:05:15,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-24 01:05:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2020-10-24 01:05:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-24 01:05:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2020-10-24 01:05:15,133 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 132 [2020-10-24 01:05:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:15,134 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2020-10-24 01:05:15,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 01:05:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2020-10-24 01:05:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-10-24 01:05:15,135 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:15,136 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:15,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 01:05:15,136 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:15,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 947277155, now seen corresponding path program 9 times [2020-10-24 01:05:15,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:15,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [816003156] [2020-10-24 01:05:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:15,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:15,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2020-10-24 01:05:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 01:05:15,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [816003156] [2020-10-24 01:05:15,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:15,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 01:05:15,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229648753] [2020-10-24 01:05:15,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 01:05:15,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 01:05:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2020-10-24 01:05:15,610 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 22 states. [2020-10-24 01:05:16,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:16,249 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2020-10-24 01:05:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 01:05:16,250 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 142 [2020-10-24 01:05:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:16,252 INFO L225 Difference]: With dead ends: 193 [2020-10-24 01:05:16,252 INFO L226 Difference]: Without dead ends: 157 [2020-10-24 01:05:16,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 01:05:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-24 01:05:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-10-24 01:05:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-24 01:05:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2020-10-24 01:05:16,271 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 142 [2020-10-24 01:05:16,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:16,271 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2020-10-24 01:05:16,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 01:05:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2020-10-24 01:05:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-10-24 01:05:16,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:16,273 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:05:16,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 01:05:16,274 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:16,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1246179191, now seen corresponding path program 10 times [2020-10-24 01:05:16,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:16,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698596688] [2020-10-24 01:05:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:25,783 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 9 [2020-10-24 01:05:28,193 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 795 DAG size of output: 8 [2020-10-24 01:05:30,622 WARN L193 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 797 DAG size of output: 9 [2020-10-24 01:05:35,646 WARN L193 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 1392 DAG size of output: 11 [2020-10-24 01:05:40,654 WARN L193 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 1399 DAG size of output: 10 [2020-10-24 01:05:45,447 WARN L193 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 687 DAG size of output: 10 [2020-10-24 01:05:45,719 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2020-10-24 01:05:45,970 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2020-10-24 01:05:46,394 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 45 [2020-10-24 01:05:46,814 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 38 [2020-10-24 01:05:47,067 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2020-10-24 01:05:47,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:47,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-10-24 01:05:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 458 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:05:47,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698596688] [2020-10-24 01:05:47,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:47,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-10-24 01:05:47,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730542418] [2020-10-24 01:05:47,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-24 01:05:47,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:47,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-24 01:05:47,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2020-10-24 01:05:47,412 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 31 states. [2020-10-24 01:05:50,058 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-10-24 01:05:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:05:50,626 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2020-10-24 01:05:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-10-24 01:05:50,627 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 152 [2020-10-24 01:05:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:05:50,630 INFO L225 Difference]: With dead ends: 179 [2020-10-24 01:05:50,630 INFO L226 Difference]: Without dead ends: 162 [2020-10-24 01:05:50,632 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=248, Invalid=3058, Unknown=0, NotChecked=0, Total=3306 [2020-10-24 01:05:50,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-24 01:05:50,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2020-10-24 01:05:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-24 01:05:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2020-10-24 01:05:50,645 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 152 [2020-10-24 01:05:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:05:50,646 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2020-10-24 01:05:50,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-10-24 01:05:50,646 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2020-10-24 01:05:50,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2020-10-24 01:05:50,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:05:50,648 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:05:50,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 01:05:50,649 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:05:50,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:05:50,649 INFO L82 PathProgramCache]: Analyzing trace with hash 388670129, now seen corresponding path program 1 times [2020-10-24 01:05:50,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:05:50,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366071972] [2020-10-24 01:05:50,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:05:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:53,606 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 34 [2020-10-24 01:05:53,961 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 41 [2020-10-24 01:05:54,473 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 59 [2020-10-24 01:05:54,958 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 47 [2020-10-24 01:05:55,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:05:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:55,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2020-10-24 01:05:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:05:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:05:56,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366071972] [2020-10-24 01:05:56,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:05:56,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-10-24 01:05:56,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788675448] [2020-10-24 01:05:56,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-10-24 01:05:56,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:05:56,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-10-24 01:05:56,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2020-10-24 01:05:56,054 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 41 states. [2020-10-24 01:05:59,393 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2020-10-24 01:06:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:06:01,253 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2020-10-24 01:06:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-10-24 01:06:01,254 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2020-10-24 01:06:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:06:01,258 INFO L225 Difference]: With dead ends: 176 [2020-10-24 01:06:01,258 INFO L226 Difference]: Without dead ends: 168 [2020-10-24 01:06:01,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1453 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=378, Invalid=5784, Unknown=0, NotChecked=0, Total=6162 [2020-10-24 01:06:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-10-24 01:06:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2020-10-24 01:06:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-24 01:06:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2020-10-24 01:06:01,283 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 158 [2020-10-24 01:06:01,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:06:01,284 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2020-10-24 01:06:01,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-10-24 01:06:01,284 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2020-10-24 01:06:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2020-10-24 01:06:01,286 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:06:01,286 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 01:06:01,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 01:06:01,287 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:06:01,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:06:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash 7354073, now seen corresponding path program 2 times [2020-10-24 01:06:01,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:06:01,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [136514207] [2020-10-24 01:06:01,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:06:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:11,278 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-10-24 01:06:11,529 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-10-24 01:06:11,819 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-10-24 01:06:12,397 WARN L193 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-10-24 01:06:12,823 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-10-24 01:06:13,666 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-10-24 01:06:13,973 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 23 [2020-10-24 01:06:14,366 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 28 [2020-10-24 01:06:14,938 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 44 [2020-10-24 01:06:15,401 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 25 [2020-10-24 01:06:15,799 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2020-10-24 01:06:16,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:06:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:16,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2020-10-24 01:06:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 468 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:06:16,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [136514207] [2020-10-24 01:06:16,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:06:16,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-10-24 01:06:16,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718634042] [2020-10-24 01:06:16,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-10-24 01:06:16,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:06:16,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-10-24 01:06:16,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 01:06:16,412 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 33 states. [2020-10-24 01:06:18,649 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2020-10-24 01:06:18,844 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2020-10-24 01:06:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:06:19,616 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2020-10-24 01:06:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-10-24 01:06:19,616 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 164 [2020-10-24 01:06:19,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:06:19,620 INFO L225 Difference]: With dead ends: 191 [2020-10-24 01:06:19,620 INFO L226 Difference]: Without dead ends: 174 [2020-10-24 01:06:19,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=263, Invalid=3277, Unknown=0, NotChecked=0, Total=3540 [2020-10-24 01:06:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-24 01:06:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2020-10-24 01:06:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-10-24 01:06:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2020-10-24 01:06:19,639 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 164 [2020-10-24 01:06:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:06:19,639 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2020-10-24 01:06:19,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-10-24 01:06:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2020-10-24 01:06:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-10-24 01:06:19,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:06:19,642 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:06:19,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 01:06:19,642 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:06:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:06:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2144334591, now seen corresponding path program 3 times [2020-10-24 01:06:19,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:06:19,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [636615614] [2020-10-24 01:06:19,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:06:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:28,646 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-10-24 01:06:29,160 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-10-24 01:06:29,397 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-10-24 01:06:29,663 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-10-24 01:06:30,183 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-10-24 01:06:30,577 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-10-24 01:06:31,321 WARN L193 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-10-24 01:06:31,912 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2020-10-24 01:06:32,484 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2020-10-24 01:06:33,105 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 25 [2020-10-24 01:06:33,646 WARN L193 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2020-10-24 01:06:34,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:06:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:34,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2020-10-24 01:06:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 482 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:06:34,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [636615614] [2020-10-24 01:06:34,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:06:34,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-10-24 01:06:34,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760069239] [2020-10-24 01:06:34,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-10-24 01:06:34,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:06:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-10-24 01:06:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1018, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 01:06:34,354 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 34 states. [2020-10-24 01:06:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:06:37,748 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2020-10-24 01:06:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-10-24 01:06:37,748 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 170 [2020-10-24 01:06:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:06:37,751 INFO L225 Difference]: With dead ends: 197 [2020-10-24 01:06:37,751 INFO L226 Difference]: Without dead ends: 180 [2020-10-24 01:06:37,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=295, Invalid=3611, Unknown=0, NotChecked=0, Total=3906 [2020-10-24 01:06:37,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-24 01:06:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2020-10-24 01:06:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-10-24 01:06:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2020-10-24 01:06:37,774 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 170 [2020-10-24 01:06:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:06:37,775 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2020-10-24 01:06:37,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-10-24 01:06:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2020-10-24 01:06:37,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-10-24 01:06:37,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:06:37,778 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:06:37,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 01:06:37,778 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:06:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:06:37,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1372543703, now seen corresponding path program 4 times [2020-10-24 01:06:37,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:06:37,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941698267] [2020-10-24 01:06:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:06:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:43,352 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 9 [2020-10-24 01:06:43,833 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 8 [2020-10-24 01:06:44,463 WARN L193 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 8 [2020-10-24 01:06:45,134 WARN L193 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 428 DAG size of output: 8 [2020-10-24 01:06:46,055 WARN L193 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 9 [2020-10-24 01:06:47,331 WARN L193 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 583 DAG size of output: 8 [2020-10-24 01:06:48,648 WARN L193 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 563 DAG size of output: 9 [2020-10-24 01:06:50,915 WARN L193 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 746 DAG size of output: 8 [2020-10-24 01:06:51,241 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 33 [2020-10-24 01:06:51,672 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 34 [2020-10-24 01:06:52,247 WARN L193 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 52 [2020-10-24 01:06:52,871 WARN L193 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 59 [2020-10-24 01:06:53,452 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 52 [2020-10-24 01:06:54,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:06:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:54,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2020-10-24 01:06:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:06:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:06:55,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941698267] [2020-10-24 01:06:55,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:06:55,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2020-10-24 01:06:55,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636114481] [2020-10-24 01:06:55,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-10-24 01:06:55,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:06:55,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-10-24 01:06:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1762, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 01:06:55,070 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 44 states. [2020-10-24 01:06:58,424 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-10-24 01:06:58,660 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-10-24 01:06:59,008 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2020-10-24 01:07:00,744 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2020-10-24 01:07:01,115 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2020-10-24 01:07:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:07:02,887 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2020-10-24 01:07:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2020-10-24 01:07:02,889 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 176 [2020-10-24 01:07:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:07:02,891 INFO L225 Difference]: With dead ends: 194 [2020-10-24 01:07:02,891 INFO L226 Difference]: Without dead ends: 186 [2020-10-24 01:07:02,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=591, Invalid=8151, Unknown=0, NotChecked=0, Total=8742 [2020-10-24 01:07:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-24 01:07:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2020-10-24 01:07:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-24 01:07:02,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2020-10-24 01:07:02,912 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 176 [2020-10-24 01:07:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:07:02,913 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2020-10-24 01:07:02,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-10-24 01:07:02,913 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2020-10-24 01:07:02,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-10-24 01:07:02,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:07:02,915 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:07:02,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 01:07:02,916 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:07:02,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:07:02,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1398308689, now seen corresponding path program 5 times [2020-10-24 01:07:02,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:07:02,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2007514491] [2020-10-24 01:07:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:07:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:08,399 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 8 [2020-10-24 01:07:08,757 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 11 [2020-10-24 01:07:09,906 WARN L193 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 650 DAG size of output: 8 [2020-10-24 01:07:10,856 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 624 DAG size of output: 8 [2020-10-24 01:07:13,498 WARN L193 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 1059 DAG size of output: 8 [2020-10-24 01:07:16,073 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 1033 DAG size of output: 9 [2020-10-24 01:07:25,143 WARN L193 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 2086 DAG size of output: 8 [2020-10-24 01:07:25,407 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-10-24 01:07:25,770 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 35 [2020-10-24 01:07:26,263 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 46 [2020-10-24 01:07:26,811 WARN L193 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 38 [2020-10-24 01:07:27,152 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 33 [2020-10-24 01:07:28,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:07:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:28,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2020-10-24 01:07:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:07:28,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2007514491] [2020-10-24 01:07:28,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:07:28,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2020-10-24 01:07:28,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956676826] [2020-10-24 01:07:28,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-10-24 01:07:28,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:07:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-10-24 01:07:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 01:07:28,260 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 36 states. [2020-10-24 01:07:31,137 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 34 [2020-10-24 01:07:31,509 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2020-10-24 01:07:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:07:32,663 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2020-10-24 01:07:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-10-24 01:07:32,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 182 [2020-10-24 01:07:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:07:32,668 INFO L225 Difference]: With dead ends: 209 [2020-10-24 01:07:32,668 INFO L226 Difference]: Without dead ends: 192 [2020-10-24 01:07:32,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=408, Invalid=4848, Unknown=0, NotChecked=0, Total=5256 [2020-10-24 01:07:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-10-24 01:07:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2020-10-24 01:07:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-10-24 01:07:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2020-10-24 01:07:32,690 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 182 [2020-10-24 01:07:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:07:32,690 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2020-10-24 01:07:32,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-10-24 01:07:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2020-10-24 01:07:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2020-10-24 01:07:32,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:07:32,692 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:07:32,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 01:07:32,692 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:07:32,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:07:32,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1850860679, now seen corresponding path program 6 times [2020-10-24 01:07:32,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:07:32,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886861053] [2020-10-24 01:07:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:07:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:40,587 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-10-24 01:07:40,915 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 8 [2020-10-24 01:07:41,135 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-10-24 01:07:41,380 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-10-24 01:07:41,668 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-10-24 01:07:42,226 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-10-24 01:07:42,655 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-10-24 01:07:43,537 WARN L193 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-10-24 01:07:44,192 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 28 [2020-10-24 01:07:44,720 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2020-10-24 01:07:45,317 WARN L193 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 25 [2020-10-24 01:07:45,872 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2020-10-24 01:07:46,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:07:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:46,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-24 01:07:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:07:46,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886861053] [2020-10-24 01:07:46,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:07:46,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-10-24 01:07:46,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306768717] [2020-10-24 01:07:46,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-10-24 01:07:46,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:07:46,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-10-24 01:07:46,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2020-10-24 01:07:46,784 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 37 states. [2020-10-24 01:07:51,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:07:51,105 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2020-10-24 01:07:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-10-24 01:07:51,106 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 188 [2020-10-24 01:07:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:07:51,108 INFO L225 Difference]: With dead ends: 215 [2020-10-24 01:07:51,108 INFO L226 Difference]: Without dead ends: 198 [2020-10-24 01:07:51,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=427, Invalid=4685, Unknown=0, NotChecked=0, Total=5112 [2020-10-24 01:07:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-24 01:07:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2020-10-24 01:07:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-10-24 01:07:51,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2020-10-24 01:07:51,129 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 188 [2020-10-24 01:07:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:07:51,129 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2020-10-24 01:07:51,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-10-24 01:07:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2020-10-24 01:07:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-10-24 01:07:51,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:07:51,131 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:07:51,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 01:07:51,131 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:07:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:07:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1940391519, now seen corresponding path program 7 times [2020-10-24 01:07:51,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:07:51,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519518793] [2020-10-24 01:07:51,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:07:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:07:59,821 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-10-24 01:08:00,182 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 8 [2020-10-24 01:08:00,412 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-10-24 01:08:00,670 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-10-24 01:08:00,967 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-10-24 01:08:01,524 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-10-24 01:08:01,971 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-10-24 01:08:02,810 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-10-24 01:08:03,092 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 29 [2020-10-24 01:08:03,541 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 36 [2020-10-24 01:08:04,162 WARN L193 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 44 [2020-10-24 01:08:04,766 WARN L193 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 38 [2020-10-24 01:08:05,169 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 33 [2020-10-24 01:08:06,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:08:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:06,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2020-10-24 01:08:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:06,280 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 598 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:08:06,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519518793] [2020-10-24 01:08:06,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:08:06,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2020-10-24 01:08:06,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948224784] [2020-10-24 01:08:06,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-10-24 01:08:06,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:08:06,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-10-24 01:08:06,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 01:08:06,283 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 38 states. [2020-10-24 01:08:09,241 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2020-10-24 01:08:09,614 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 34 [2020-10-24 01:08:10,049 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 35 [2020-10-24 01:08:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:08:11,620 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2020-10-24 01:08:11,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-10-24 01:08:11,621 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 194 [2020-10-24 01:08:11,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:08:11,623 INFO L225 Difference]: With dead ends: 221 [2020-10-24 01:08:11,623 INFO L226 Difference]: Without dead ends: 204 [2020-10-24 01:08:11,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=514, Invalid=5648, Unknown=0, NotChecked=0, Total=6162 [2020-10-24 01:08:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-24 01:08:11,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2020-10-24 01:08:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-10-24 01:08:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2020-10-24 01:08:11,655 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 194 [2020-10-24 01:08:11,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:08:11,655 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2020-10-24 01:08:11,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-10-24 01:08:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2020-10-24 01:08:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-10-24 01:08:11,656 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:08:11,657 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:08:11,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 01:08:11,657 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:08:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:08:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash 261921225, now seen corresponding path program 8 times [2020-10-24 01:08:11,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:08:11,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1705269586] [2020-10-24 01:08:11,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:08:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:15,402 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 8 [2020-10-24 01:08:15,639 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 8 [2020-10-24 01:08:16,036 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 8 [2020-10-24 01:08:16,431 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 8 [2020-10-24 01:08:17,165 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 321 DAG size of output: 8 [2020-10-24 01:08:17,641 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 35 [2020-10-24 01:08:18,174 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 44 [2020-10-24 01:08:18,849 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 42 [2020-10-24 01:08:19,170 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 15 [2020-10-24 01:08:20,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:08:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:20,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2020-10-24 01:08:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 0 proven. 642 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:08:20,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1705269586] [2020-10-24 01:08:20,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:08:20,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2020-10-24 01:08:20,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154608769] [2020-10-24 01:08:20,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-10-24 01:08:20,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:08:20,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-10-24 01:08:20,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1342, Unknown=0, NotChecked=0, Total=1482 [2020-10-24 01:08:20,540 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 39 states. [2020-10-24 01:08:24,772 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-10-24 01:08:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:08:26,825 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2020-10-24 01:08:26,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2020-10-24 01:08:26,826 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 200 [2020-10-24 01:08:26,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:08:26,829 INFO L225 Difference]: With dead ends: 233 [2020-10-24 01:08:26,829 INFO L226 Difference]: Without dead ends: 216 [2020-10-24 01:08:26,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=633, Invalid=6339, Unknown=0, NotChecked=0, Total=6972 [2020-10-24 01:08:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-24 01:08:26,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2020-10-24 01:08:26,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-10-24 01:08:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2020-10-24 01:08:26,854 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 200 [2020-10-24 01:08:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:08:26,854 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2020-10-24 01:08:26,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-10-24 01:08:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2020-10-24 01:08:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-10-24 01:08:26,856 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:08:26,856 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:08:26,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 01:08:26,857 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:08:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:08:26,857 INFO L82 PathProgramCache]: Analyzing trace with hash 514859033, now seen corresponding path program 9 times [2020-10-24 01:08:26,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:08:26,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [465027545] [2020-10-24 01:08:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:08:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:30,726 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 8 [2020-10-24 01:08:31,206 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 418 DAG size of output: 8 [2020-10-24 01:08:32,520 WARN L193 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 672 DAG size of output: 8 [2020-10-24 01:08:33,607 WARN L193 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 674 DAG size of output: 8 [2020-10-24 01:08:35,616 WARN L193 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 931 DAG size of output: 8 [2020-10-24 01:08:36,000 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 29 [2020-10-24 01:08:36,365 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 38 [2020-10-24 01:08:36,698 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2020-10-24 01:08:36,925 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-10-24 01:08:39,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:08:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:39,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2020-10-24 01:08:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:08:39,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [465027545] [2020-10-24 01:08:39,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:08:39,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2020-10-24 01:08:39,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751471229] [2020-10-24 01:08:39,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 48 states [2020-10-24 01:08:39,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:08:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2020-10-24 01:08:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2136, Unknown=0, NotChecked=0, Total=2256 [2020-10-24 01:08:39,930 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 48 states. [2020-10-24 01:08:44,231 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-10-24 01:08:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:08:51,341 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2020-10-24 01:08:51,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2020-10-24 01:08:51,344 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 212 [2020-10-24 01:08:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:08:51,346 INFO L225 Difference]: With dead ends: 230 [2020-10-24 01:08:51,346 INFO L226 Difference]: Without dead ends: 222 [2020-10-24 01:08:51,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=458, Invalid=10048, Unknown=0, NotChecked=0, Total=10506 [2020-10-24 01:08:51,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-10-24 01:08:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2020-10-24 01:08:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2020-10-24 01:08:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2020-10-24 01:08:51,374 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 212 [2020-10-24 01:08:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:08:51,375 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2020-10-24 01:08:51,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2020-10-24 01:08:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2020-10-24 01:08:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-10-24 01:08:51,377 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 01:08:51,377 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 01:08:51,377 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 01:08:51,377 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 01:08:51,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 01:08:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2024539713, now seen corresponding path program 10 times [2020-10-24 01:08:51,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 01:08:51,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887335706] [2020-10-24 01:08:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 01:08:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:08:58,842 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 11 [2020-10-24 01:08:59,371 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 8 [2020-10-24 01:08:59,627 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 11 [2020-10-24 01:08:59,899 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 8 [2020-10-24 01:09:00,226 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 8 [2020-10-24 01:09:00,867 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 8 [2020-10-24 01:09:01,292 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 8 [2020-10-24 01:09:02,154 WARN L193 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 8 [2020-10-24 01:09:02,444 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-10-24 01:09:02,899 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 27 [2020-10-24 01:09:03,524 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 31 [2020-10-24 01:09:04,276 WARN L193 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 25 [2020-10-24 01:09:04,972 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 31 [2020-10-24 01:09:06,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 01:09:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:06,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2020-10-24 01:09:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 01:09:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 342 proven. 468 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 01:09:06,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887335706] [2020-10-24 01:09:06,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 01:09:06,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-10-24 01:09:06,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060122172] [2020-10-24 01:09:06,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-10-24 01:09:06,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 01:09:06,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-10-24 01:09:06,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1473, Unknown=0, NotChecked=0, Total=1640 [2020-10-24 01:09:06,475 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 41 states. [2020-10-24 01:09:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 01:09:11,345 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2020-10-24 01:09:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-10-24 01:09:11,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 218 [2020-10-24 01:09:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 01:09:11,347 INFO L225 Difference]: With dead ends: 219 [2020-10-24 01:09:11,347 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 01:09:11,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=462, Invalid=4940, Unknown=0, NotChecked=0, Total=5402 [2020-10-24 01:09:11,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 01:09:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 01:09:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 01:09:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 01:09:11,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 218 [2020-10-24 01:09:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 01:09:11,348 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 01:09:11,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-10-24 01:09:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 01:09:11,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 01:09:11,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 01:09:11,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 01:09:12,316 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2020-10-24 01:09:12,850 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 33 [2020-10-24 01:09:13,401 WARN L193 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2020-10-24 01:09:13,991 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2020-10-24 01:09:14,221 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-10-24 01:09:14,466 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2020-10-24 01:09:15,007 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 35 [2020-10-24 01:09:15,924 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 39 [2020-10-24 01:09:17,407 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 129 DAG size of output: 88 [2020-10-24 01:09:18,855 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,866 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,867 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 01:09:18,868 INFO L270 CegarLoopResult]: At program point L39-6(lines 39 41) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-10-24 01:09:18,868 INFO L270 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,868 INFO L270 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,868 INFO L270 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,869 INFO L270 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,869 INFO L270 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,869 INFO L270 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,869 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 22 52) the Hoare annotation is: true [2020-10-24 01:09:18,869 INFO L270 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse7 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)))) (let ((.cse2 (= |main_~#array~0.offset| 0)) (.cse3 (= .cse0 .cse7))) (or (let ((.cse1 (+ main_~i~0 5))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (let ((.cse4 (+ main_~i~0 8))) (and (<= .cse4 .cse0) .cse2 .cse3 (<= .cse0 .cse4))) (let ((.cse5 (+ main_~i~0 6))) (and .cse2 .cse3 (<= .cse5 .cse0) (<= .cse0 .cse5))) (let ((.cse6 (+ main_~i~0 10))) (and (= .cse6 .cse7) (<= .cse6 .cse0) .cse2 (<= .cse0 .cse6))) (let ((.cse8 (+ main_~i~0 3))) (and (<= .cse0 .cse8) (<= .cse8 .cse0) .cse2 .cse3)) (let ((.cse9 (+ main_~i~0 2))) (and (<= .cse9 .cse0) .cse2 .cse3 (<= .cse0 .cse9))) (let ((.cse10 (+ main_~i~0 4))) (and (<= .cse10 .cse0) (<= .cse0 .cse10) .cse2 .cse3)) (let ((.cse11 (+ main_~i~0 9))) (and (<= .cse11 .cse0) (<= .cse0 .cse11) .cse2 .cse3)) (let ((.cse12 (+ main_~i~0 7))) (and (<= .cse12 .cse0) .cse2 (<= .cse0 .cse12) .cse3)) (let ((.cse13 (+ main_~i~0 1))) (and (<= .cse13 .cse0) (<= .cse0 .cse13) .cse2 .cse3))))) [2020-10-24 01:09:18,870 INFO L270 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse7 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)))) (let ((.cse2 (= |main_~#array~0.offset| 0)) (.cse3 (= .cse0 .cse7))) (or (let ((.cse1 (+ main_~i~0 5))) (and (<= .cse0 .cse1) .cse2 (<= .cse1 .cse0) .cse3)) (let ((.cse4 (+ main_~i~0 8))) (and (<= .cse4 .cse0) .cse2 .cse3 (<= .cse0 .cse4))) (let ((.cse5 (+ main_~i~0 6))) (and .cse2 .cse3 (<= .cse5 .cse0) (<= .cse0 .cse5))) (let ((.cse6 (+ main_~i~0 10))) (and (= .cse6 .cse7) (<= .cse6 .cse0) .cse2 (<= .cse0 .cse6))) (let ((.cse8 (+ main_~i~0 3))) (and (<= .cse0 .cse8) (<= .cse8 .cse0) .cse2 .cse3)) (let ((.cse9 (+ main_~i~0 2))) (and (<= .cse9 .cse0) .cse2 .cse3 (<= .cse0 .cse9))) (let ((.cse10 (+ main_~i~0 4))) (and (<= .cse10 .cse0) (<= .cse0 .cse10) .cse2 .cse3)) (let ((.cse11 (+ main_~i~0 9))) (and (<= .cse11 .cse0) (<= .cse0 .cse11) .cse2 .cse3)) (let ((.cse12 (+ main_~i~0 7))) (and (<= .cse12 .cse0) .cse2 (<= .cse0 .cse12) .cse3)) (let ((.cse13 (+ main_~i~0 1))) (and (<= .cse13 .cse0) (<= .cse0 .cse13) .cse2 .cse3))))) [2020-10-24 01:09:18,870 INFO L270 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse0 (= |main_~#array~0.offset| 0)) (.cse1 (= .cse2 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))))) (or (and .cse0 .cse1 (<= main_~i~0 .cse2) (<= .cse2 (+ main_~i~0 8))) (let ((.cse3 (+ main_~i~0 9))) (and (<= .cse3 .cse2) (<= .cse2 .cse3) .cse0 .cse1))))) [2020-10-24 01:09:18,870 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= |main_#t~mem13.offset| .cse0) (< 0 (+ (* 8 main_~i~0) |main_~#array~0.offset| 1)) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_#t~mem13.base|) (= |main_~#array~0.offset| 0) (= .cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (= |main_#t~mem13.base| |main_~#array~0.base|))) [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= |main_#t~mem13.offset| .cse0) (= .cse1 main_~pa~0.base) (= .cse1 |main_#t~mem13.base|) (= |main_~#array~0.offset| 0) (= .cse2 .cse0) (= (+ .cse2 4) main_~pa~0.offset) (or (< 1 main_~i~0) (= .cse0 0) (= 12 main_~pa~0.offset)) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,871 INFO L277 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-10-24 01:09:18,871 INFO L277 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: true [2020-10-24 01:09:18,871 INFO L277 CegarLoopResult]: At program point L24-2(line 24) the Hoare annotation is: true [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: false [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: false [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= .cse1 .cse0) (= (+ .cse1 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L37-2(lines 37 45) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,871 INFO L270 CegarLoopResult]: At program point L37-3(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|))) (and (= (+ |main_#t~mem14.offset| 4) main_~pa~0.offset) (= .cse0 |main_#t~mem14.offset|) (= |main_#t~mem14.base| main_~pa~0.base) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) .cse0) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= .cse1 .cse0) (= (+ .cse1 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,872 INFO L277 CegarLoopResult]: At program point L37-6(line 37) the Hoare annotation is: true [2020-10-24 01:09:18,872 INFO L277 CegarLoopResult]: At program point L37-7(line 37) the Hoare annotation is: true [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L29-3(lines 29 32) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L29-4(line 29) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L29-5(line 29) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,872 INFO L277 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: true [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L29-6(lines 29 32) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,872 INFO L277 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: true [2020-10-24 01:09:18,872 INFO L270 CegarLoopResult]: At program point L29-7(lines 23 52) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: false [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L25-4(line 25) the Hoare annotation is: false [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: false [2020-10-24 01:09:18,873 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 22 52) the Hoare annotation is: true [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= 1 |main_#t~ret19|) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L42-1(lines 42 44) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= 1 |main_#t~ret19|) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L42-2(line 42) the Hoare annotation is: false [2020-10-24 01:09:18,873 INFO L277 CegarLoopResult]: At program point L42-3(line 42) the Hoare annotation is: true [2020-10-24 01:09:18,873 INFO L270 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (or (= .cse0 0) (< 11 main_~pa~0.offset)) (= .cse1 .cse0) (= (+ .cse1 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse1 (+ (* main_~i~0 8) |main_~#array~0.offset|)) (.cse2 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) main_~pa~0.base) (= |main_~#array~0.offset| 0) (<= |main_#t~mem16| .cse0) (or (= .cse1 0) (< 11 main_~pa~0.offset)) (= .cse2 .cse1) (= (+ .cse2 4) main_~pa~0.offset) (<= .cse0 |main_#t~mem16|) (= |main_~#array~0.base| main_~pa~0.base))) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L38-2(line 38) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 10)) (.cse1 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= .cse0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= .cse0 .cse1) (= |main_~#array~0.offset| 0) (<= |main_#t~mem16| .cse1) (<= .cse1 .cse0) (<= .cse1 |main_#t~mem16|))) [2020-10-24 01:09:18,874 INFO L277 CegarLoopResult]: At program point L34(lines 34 46) the Hoare annotation is: true [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point mainENTRY(lines 22 52) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (and (= |main_~#array~0.offset| 0) (<= main_~j~0 9)) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (= |main_~#array~0.offset| 0) [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: false [2020-10-24 01:09:18,874 INFO L270 CegarLoopResult]: At program point L43(lines 23 52) the Hoare annotation is: false [2020-10-24 01:09:18,875 INFO L270 CegarLoopResult]: At program point L39-1(lines 39 41) the Hoare annotation is: (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse15 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (.cse7 (<= |main_#t~mem17| .cse0)) (.cse12 (+ main_~i~0 7)) (.cse3 (+ main_~i~0 5)) (.cse8 (+ main_~i~0 1))) (let ((.cse6 (<= .cse8 |main_#t~mem17|)) (.cse4 (<= .cse3 |main_#t~mem17|)) (.cse13 (or .cse7 (and (<= .cse12 .cse0) (<= main_~pa~0.offset 4) (< 3 main_~pa~0.offset)))) (.cse2 (= .cse0 .cse15)) (.cse1 (= |main_~#array~0.offset| 0))) (or (and (<= main_~i~0 |main_#t~mem17|) (<= .cse0 main_~i~0) .cse1 (<= |main_#t~mem17| main_~i~0) .cse2 (<= main_~i~0 .cse0)) (and (<= .cse0 .cse3) .cse4 .cse1 (<= .cse3 .cse0) .cse2) (let ((.cse5 (+ main_~i~0 2))) (and (<= .cse5 .cse0) .cse6 .cse1 .cse2 (<= .cse0 .cse5))) (and .cse7 (<= .cse0 .cse8) .cse6 .cse1 .cse2) (let ((.cse9 (+ main_~i~0 4))) (and (<= .cse9 |main_#t~mem17|) (<= .cse9 .cse0) (<= .cse0 .cse9) .cse1 .cse2)) (let ((.cse10 (+ main_~i~0 6))) (and .cse4 .cse1 .cse2 (<= .cse10 .cse0) (<= .cse0 .cse10))) (let ((.cse11 (+ main_~i~0 3))) (and (<= .cse11 |main_#t~mem17|) (<= .cse0 .cse11) (<= .cse11 .cse0) .cse1 .cse2)) (and (<= .cse12 |main_#t~mem17|) .cse13 .cse1 (<= .cse0 .cse12) .cse2) (and (<= (+ main_~i~0 8) |main_#t~mem17|) .cse13 (<= .cse0 (+ main_~i~0 9)) .cse1 .cse2) (let ((.cse14 (+ main_~i~0 10))) (and (= .cse14 .cse15) (= |main_#t~mem17| .cse0) (<= .cse14 .cse0) .cse1 (<= .cse0 .cse14))))))) [2020-10-24 01:09:18,875 INFO L270 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (and (= main_~i~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (<= main_~i~0 |main_#t~mem17|) (= |main_~#array~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) [2020-10-24 01:09:18,875 INFO L270 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (< 0 (+ (* 8 main_~i~0) |main_~#array~0.offset| 1)) (= |main_~#array~0.offset| 0)) [2020-10-24 01:09:18,875 INFO L270 CegarLoopResult]: At program point L39-4(line 39) the Hoare annotation is: (let ((.cse5 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (let ((.cse17 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (.cse13 (<= |main_#t~mem17| .cse5)) (.cse6 (+ main_~i~0 7)) (.cse15 (+ main_~i~0 5))) (let ((.cse3 (<= .cse15 |main_#t~mem17|)) (.cse9 (+ main_~i~0 3)) (.cse11 (+ main_~i~0 8)) (.cse2 (or .cse13 (and (<= .cse6 .cse5) (<= main_~pa~0.offset 4) (< 3 main_~pa~0.offset)))) (.cse0 (or (= |main_#t~mem17| .cse17) (< main_~i~0 |main_#t~mem17|))) (.cse10 (+ main_~i~0 4)) (.cse1 (<= main_~i~0 |main_#t~mem17|)) (.cse7 (= .cse5 .cse17)) (.cse4 (= |main_~#array~0.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 .cse6) .cse7) (let ((.cse8 (+ main_~i~0 6))) (and .cse0 .cse1 .cse3 .cse4 .cse7 (<= .cse8 .cse5) (<= .cse5 .cse8))) (and .cse0 .cse1 (<= .cse9 |main_#t~mem17|) (<= .cse10 .cse5) (<= .cse5 .cse10) .cse4 .cse7) (and .cse0 .cse1 (<= .cse6 |main_#t~mem17|) .cse2 .cse4 .cse7 (<= .cse5 .cse11)) (let ((.cse12 (+ main_~i~0 2))) (and .cse0 .cse1 (<= .cse12 .cse5) .cse4 .cse7 (<= .cse5 .cse12))) (and .cse0 .cse1 .cse4 (<= .cse5 .cse9) (<= .cse9 .cse5) .cse7) (let ((.cse14 (+ main_~i~0 1))) (and .cse0 .cse1 .cse13 (<= .cse5 .cse14) (<= .cse14 |main_#t~mem17|) .cse4 .cse7)) (and (<= .cse11 |main_#t~mem17|) .cse2 (<= .cse5 (+ main_~i~0 9)) .cse4 .cse7) (and .cse0 (<= .cse5 .cse15) (<= .cse10 |main_#t~mem17|) .cse1 .cse4 (<= .cse15 .cse5) .cse7) (let ((.cse16 (+ main_~i~0 10))) (and (= .cse16 .cse17) (= |main_#t~mem17| .cse5) (<= .cse16 .cse5) .cse4 (<= .cse5 .cse16))))))) [2020-10-24 01:09:18,875 INFO L270 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#array~0.base|) (< 0 (+ (* 8 main_~i~0) |main_~#array~0.offset| 1)) (= |main_~#array~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (+ (* main_~i~0 8) |main_~#array~0.offset|))) [2020-10-24 01:09:18,875 INFO L270 CegarLoopResult]: At program point L39-5(lines 39 41) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (.cse1 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)))) (let ((.cse3 (= |main_~#array~0.offset| 0)) (.cse4 (= .cse2 .cse1))) (or (let ((.cse0 (+ main_~i~0 10))) (and (= .cse0 .cse1) (<= .cse0 .cse2) .cse3 (<= .cse2 .cse0))) (and .cse3 .cse4 (<= main_~i~0 .cse2) (<= .cse2 (+ main_~i~0 8))) (let ((.cse5 (+ main_~i~0 9))) (and (<= .cse5 .cse2) (<= .cse2 .cse5) .cse3 .cse4))))) [2020-10-24 01:09:18,876 INFO L270 CegarLoopResult]: At program point L17(lines 17 20) the Hoare annotation is: (and (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|)) [2020-10-24 01:09:18,876 INFO L270 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|))) (and (= |check_#t~mem7.offset| .cse0) (= |check_#in~i| check_~i) (= .cse1 |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= (select (select |#memory_int| .cse1) (+ .cse0 4)) |check_#t~mem8|) (= check_~pc.base |check_#in~pc.base|))) [2020-10-24 01:09:18,876 INFO L270 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|))) (let ((.cse2 (select (select |#memory_int| .cse1) (+ .cse0 4)))) (and (= |check_#t~mem7.offset| .cse0) (= |check_#in~i| check_~i) (= .cse1 |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= .cse2 |check_#t~mem8|) (= check_~pc.base |check_#in~pc.base|) (or (not (= .cse2 |check_#in~i|)) (<= 1 |check_#res|))))) [2020-10-24 01:09:18,876 INFO L277 CegarLoopResult]: At program point checkENTRY(lines 17 20) the Hoare annotation is: true [2020-10-24 01:09:18,876 INFO L270 CegarLoopResult]: At program point L19-4(line 19) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|))) (and (= |check_#t~mem7.offset| .cse0) (= |check_#in~i| check_~i) (= .cse1 |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|) (or (not (= (select (select |#memory_int| .cse1) (+ .cse0 4)) |check_#in~i|)) (<= 1 |check_#res|)))) [2020-10-24 01:09:18,876 INFO L270 CegarLoopResult]: At program point checkFINAL(lines 17 20) the Hoare annotation is: (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|) (or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (<= 1 |check_#res|))) [2020-10-24 01:09:18,876 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|)) [2020-10-24 01:09:18,877 INFO L270 CegarLoopResult]: At program point checkEXIT(lines 17 20) the Hoare annotation is: (and (= |check_#in~i| check_~i) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|) (or (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|)) (+ (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|) 4)) |check_#in~i|)) (<= 1 |check_#res|))) [2020-10-24 01:09:18,877 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (= |check_#t~mem7.offset| (select (select |#memory_$Pointer$.offset| |check_#in~pc.base|) |check_#in~pc.offset|)) (= |check_#in~i| check_~i) (= (select (select |#memory_$Pointer$.base| |check_#in~pc.base|) |check_#in~pc.offset|) |check_#t~mem7.base|) (= check_~pc.offset |check_#in~pc.offset|) (= check_~pc.base |check_#in~pc.base|)) [2020-10-24 01:09:18,899 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,900 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,902 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,903 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,911 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,912 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,917 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,917 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,918 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,919 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,920 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,921 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,922 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,933 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:09:18 BoogieIcfgContainer [2020-10-24 01:09:18,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 01:09:18,937 INFO L168 Benchmark]: Toolchain (without parser) took 252423.09 ms. Allocated memory was 151.0 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 127.8 MB in the beginning and 695.7 MB in the end (delta: -567.9 MB). Peak memory consumption was 1.1 GB. Max. memory is 8.0 GB. [2020-10-24 01:09:18,938 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 125.2 MB in the end (delta: 120.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 01:09:18,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.45 ms. Allocated memory is still 151.0 MB. Free memory was 127.2 MB in the beginning and 117.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:18,939 INFO L168 Benchmark]: Boogie Preprocessor took 69.59 ms. Allocated memory is still 151.0 MB. Free memory was 117.3 MB in the beginning and 115.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:18,939 INFO L168 Benchmark]: RCFGBuilder took 654.55 ms. Allocated memory is still 151.0 MB. Free memory was 115.5 MB in the beginning and 126.5 MB in the end (delta: -11.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 8.0 GB. [2020-10-24 01:09:18,940 INFO L168 Benchmark]: TraceAbstraction took 251412.60 ms. Allocated memory was 151.0 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 126.0 MB in the beginning and 695.7 MB in the end (delta: -569.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 8.0 GB. [2020-10-24 01:09:18,943 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.23 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 125.2 MB in the end (delta: 120.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 273.45 ms. Allocated memory is still 151.0 MB. Free memory was 127.2 MB in the beginning and 117.3 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.59 ms. Allocated memory is still 151.0 MB. Free memory was 117.3 MB in the beginning and 115.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 654.55 ms. Allocated memory is still 151.0 MB. Free memory was 115.5 MB in the beginning and 126.5 MB in the end (delta: -11.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 251412.60 ms. Allocated memory was 151.0 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 126.0 MB in the beginning and 695.7 MB in the end (delta: -569.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * 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: 23]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: array == 0 - InvariantResult [Line: 39]: Loop Invariant [2020-10-24 01:09:18,968 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,968 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,968 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,969 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,969 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,969 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,974 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,975 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,979 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,979 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,980 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,980 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,980 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,980 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,981 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,981 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,983 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,983 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,983 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,983 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,984 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,984 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,984 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,985 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,985 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,985 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((i + 10 == unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4] && i + 10 <= unknown-#memory_int-unknown[pa][pa]) && array == 0) && unknown-#memory_int-unknown[pa][pa] <= i + 10) || (((array == 0 && unknown-#memory_int-unknown[pa][pa] == unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) && i <= unknown-#memory_int-unknown[pa][pa]) && unknown-#memory_int-unknown[pa][pa] <= i + 8)) || (((i + 9 <= unknown-#memory_int-unknown[pa][pa] && unknown-#memory_int-unknown[pa][pa] <= i + 9) && array == 0) && unknown-#memory_int-unknown[pa][pa] == unknown-#memory_int-unknown[#memory_$Pointer$[cont][cont]][#memory_$Pointer$[cont][cont] + 4]) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for check [2020-10-24 01:09:18,988 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,989 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,990 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-10-24 01:09:18,990 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-10-24 01:09:18,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-24 01:09:18,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-10-24 01:09:18,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived contract for procedure check: ((\old(i) == i && pc == pc) && pc == pc) && (!(unknown-#memory_int-unknown[#memory_$Pointer$[pc][pc]][#memory_$Pointer$[pc][pc] + 4] == \old(i)) || 1 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 243.7s, OverallIterations: 21, TraceHistogramMax: 12, AutomataDifference: 64.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1619 SDtfs, 1893 SDslu, 25011 SDs, 0 SdLazy, 27360 SolverSat, 372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1140 GetRequests, 115 SyntacticMatches, 8 SemanticMatches, 1017 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15125 ImplicationChecksByTransitivity, 139.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 102 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 86 LocationsWithAnnotation, 346 PreInvPairs, 530 NumberOfFragments, 3361 HoareAnnotationTreeSize, 346 FomulaSimplifications, 109325 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 86 FomulaSimplificationsInter, 16807 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 174.2s InterpolantComputationTime, 2982 NumberOfCodeBlocks, 2982 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2961 ConstructedInterpolants, 0 QuantifiedInterpolants, 4720394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 364/7523 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...