/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/loop-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:28:37,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:28:37,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:28:37,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:28:37,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:28:37,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:28:37,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:28:37,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:28:37,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:28:37,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:28:37,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:28:37,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:28:37,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:28:37,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:28:37,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:28:37,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:28:37,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:28:37,882 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:28:37,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:28:37,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:28:37,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:28:37,891 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:28:37,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:28:37,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:28:37,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:28:37,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:28:37,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:28:37,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:28:37,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:28:37,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:28:37,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:28:37,939 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:28:37,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:28:37,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:28:37,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:28:37,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:28:37,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:28:37,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:28:37,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:28:37,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:28:37,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:28:37,948 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 02:28:37,974 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:28:37,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:28:37,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:28:37,981 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:28:37,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:28:37,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:28:37,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:28:37,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:28:37,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:28:37,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:28:37,983 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:28:37,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:28:37,984 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:28:37,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:28:37,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:28:37,985 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:28:37,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:28:37,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:28:37,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:28:37,986 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:28:37,986 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:28:37,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:28:37,986 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 02:28:38,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:28:38,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:28:38,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:28:38,518 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:28:38,518 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:28:38,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2020-10-24 02:28:38,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c160146e/245338160f514635aace359615642108/FLAGb18811b03 [2020-10-24 02:28:39,220 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:28:39,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2020-10-24 02:28:39,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c160146e/245338160f514635aace359615642108/FLAGb18811b03 [2020-10-24 02:28:39,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c160146e/245338160f514635aace359615642108 [2020-10-24 02:28:39,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:28:39,598 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:28:39,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:28:39,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:28:39,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:28:39,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15330b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39, skipping insertion in model container [2020-10-24 02:28:39,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:28:39,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:28:39,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:28:39,902 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:28:39,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:28:39,959 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:28:39,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39 WrapperNode [2020-10-24 02:28:39,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:28:39,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:28:39,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:28:39,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:28:39,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (1/1) ... [2020-10-24 02:28:39,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:28:40,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:28:40,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:28:40,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:28:40,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (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 02:28:40,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:28:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:28:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:28:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 02:28:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:28:40,082 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:28:40,082 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:28:40,082 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:28:40,082 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-24 02:28:40,082 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-24 02:28:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:28:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:28:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 02:28:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:28:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:28:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:28:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:28:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:28:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:28:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:28:40,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:28:40,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:28:40,636 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:28:40,637 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-10-24 02:28:40,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:28:40 BoogieIcfgContainer [2020-10-24 02:28:40,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:28:40,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:28:40,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:28:40,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:28:40,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:28:39" (1/3) ... [2020-10-24 02:28:40,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f801223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:28:40, skipping insertion in model container [2020-10-24 02:28:40,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:28:39" (2/3) ... [2020-10-24 02:28:40,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f801223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:28:40, skipping insertion in model container [2020-10-24 02:28:40,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:28:40" (3/3) ... [2020-10-24 02:28:40,651 INFO L111 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-10-24 02:28:40,664 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:28:40,670 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:28:40,685 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:28:40,723 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:28:40,723 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:28:40,723 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:28:40,723 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:28:40,723 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:28:40,724 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:28:40,724 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:28:40,724 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:28:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-10-24 02:28:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-24 02:28:40,763 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:40,764 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:28:40,764 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:40,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:40,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1439685491, now seen corresponding path program 1 times [2020-10-24 02:28:40,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:40,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1709535791] [2020-10-24 02:28:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:41,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:41,151 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 02:28:41,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1709535791] [2020-10-24 02:28:41,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:28:41,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 02:28:41,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996693173] [2020-10-24 02:28:41,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 02:28:41,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 02:28:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:28:41,182 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-10-24 02:28:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:41,280 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2020-10-24 02:28:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 02:28:41,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-10-24 02:28:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:41,293 INFO L225 Difference]: With dead ends: 90 [2020-10-24 02:28:41,293 INFO L226 Difference]: Without dead ends: 57 [2020-10-24 02:28:41,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:28:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-24 02:28:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-24 02:28:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 02:28:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-10-24 02:28:41,395 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 36 [2020-10-24 02:28:41,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:41,397 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-10-24 02:28:41,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 02:28:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-10-24 02:28:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-24 02:28:41,400 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:41,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:28:41,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:28:41,401 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:41,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:41,403 INFO L82 PathProgramCache]: Analyzing trace with hash -563113616, now seen corresponding path program 1 times [2020-10-24 02:28:41,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:41,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [945148818] [2020-10-24 02:28:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:41,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:41,547 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 02:28:41,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [945148818] [2020-10-24 02:28:41,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:28:41,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 02:28:41,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705692213] [2020-10-24 02:28:41,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:28:41,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:28:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:28:41,552 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 6 states. [2020-10-24 02:28:41,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:41,886 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-10-24 02:28:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:28:41,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-10-24 02:28:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:41,888 INFO L225 Difference]: With dead ends: 78 [2020-10-24 02:28:41,889 INFO L226 Difference]: Without dead ends: 60 [2020-10-24 02:28:41,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:28:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-24 02:28:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-10-24 02:28:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-24 02:28:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2020-10-24 02:28:41,906 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 36 [2020-10-24 02:28:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:41,907 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2020-10-24 02:28:41,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:28:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2020-10-24 02:28:41,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 02:28:41,908 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:41,909 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] [2020-10-24 02:28:41,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:28:41,909 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -115429657, now seen corresponding path program 1 times [2020-10-24 02:28:41,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:41,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220927125] [2020-10-24 02:28:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:42,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:42,051 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 02:28:42,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220927125] [2020-10-24 02:28:42,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:42,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:28:42,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918188512] [2020-10-24 02:28:42,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:28:42,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:28:42,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:28:42,056 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2020-10-24 02:28:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:42,632 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2020-10-24 02:28:42,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:28:42,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-10-24 02:28:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:42,635 INFO L225 Difference]: With dead ends: 99 [2020-10-24 02:28:42,635 INFO L226 Difference]: Without dead ends: 95 [2020-10-24 02:28:42,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:28:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-24 02:28:42,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2020-10-24 02:28:42,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-24 02:28:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-10-24 02:28:42,659 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2020-10-24 02:28:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:42,660 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-10-24 02:28:42,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:28:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-10-24 02:28:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-24 02:28:42,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:42,662 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] [2020-10-24 02:28:42,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:28:42,663 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:42,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:42,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1489312715, now seen corresponding path program 1 times [2020-10-24 02:28:42,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:42,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1351064904] [2020-10-24 02:28:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:42,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:42,812 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 02:28:42,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1351064904] [2020-10-24 02:28:42,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:42,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:28:42,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254299581] [2020-10-24 02:28:42,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:28:42,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:28:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:28:42,821 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2020-10-24 02:28:43,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:43,466 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2020-10-24 02:28:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:28:43,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-10-24 02:28:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:43,470 INFO L225 Difference]: With dead ends: 116 [2020-10-24 02:28:43,470 INFO L226 Difference]: Without dead ends: 112 [2020-10-24 02:28:43,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:28:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-24 02:28:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2020-10-24 02:28:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-24 02:28:43,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2020-10-24 02:28:43,495 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 47 [2020-10-24 02:28:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:43,496 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2020-10-24 02:28:43,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:28:43,496 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2020-10-24 02:28:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-24 02:28:43,498 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:43,498 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] [2020-10-24 02:28:43,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:28:43,498 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:43,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:43,499 INFO L82 PathProgramCache]: Analyzing trace with hash -196114581, now seen corresponding path program 1 times [2020-10-24 02:28:43,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:43,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475163568] [2020-10-24 02:28:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:43,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:43,617 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 02:28:43,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475163568] [2020-10-24 02:28:43,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:43,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:28:43,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072209548] [2020-10-24 02:28:43,618 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:28:43,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:43,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:28:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:28:43,620 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 8 states. [2020-10-24 02:28:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:44,171 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2020-10-24 02:28:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:28:44,171 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-10-24 02:28:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:44,173 INFO L225 Difference]: With dead ends: 127 [2020-10-24 02:28:44,173 INFO L226 Difference]: Without dead ends: 123 [2020-10-24 02:28:44,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:28:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-24 02:28:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2020-10-24 02:28:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-24 02:28:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2020-10-24 02:28:44,201 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 47 [2020-10-24 02:28:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:44,202 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2020-10-24 02:28:44,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:28:44,202 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2020-10-24 02:28:44,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 02:28:44,203 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:44,204 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:28:44,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:28:44,204 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:44,205 INFO L82 PathProgramCache]: Analyzing trace with hash -2099559550, now seen corresponding path program 1 times [2020-10-24 02:28:44,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:44,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238464068] [2020-10-24 02:28:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:44,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:28:44,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238464068] [2020-10-24 02:28:44,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:44,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:28:44,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602282620] [2020-10-24 02:28:44,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:28:44,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:28:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:28:44,299 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 7 states. [2020-10-24 02:28:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:44,683 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2020-10-24 02:28:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:28:44,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2020-10-24 02:28:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:44,689 INFO L225 Difference]: With dead ends: 135 [2020-10-24 02:28:44,690 INFO L226 Difference]: Without dead ends: 66 [2020-10-24 02:28:44,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:28:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-24 02:28:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-10-24 02:28:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-24 02:28:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-10-24 02:28:44,726 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2020-10-24 02:28:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:44,726 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-10-24 02:28:44,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:28:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-10-24 02:28:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 02:28:44,727 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:44,728 INFO L422 BasicCegarLoop]: trace histogram [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 02:28:44,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:28:44,731 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -855406281, now seen corresponding path program 1 times [2020-10-24 02:28:44,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:44,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1822622182] [2020-10-24 02:28:44,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:44,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:44,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-10-24 02:28:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:28:44,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1822622182] [2020-10-24 02:28:44,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:44,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:28:44,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768942690] [2020-10-24 02:28:44,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:28:44,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:28:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:28:44,951 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 10 states. [2020-10-24 02:28:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:45,582 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2020-10-24 02:28:45,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:28:45,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-10-24 02:28:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:45,585 INFO L225 Difference]: With dead ends: 93 [2020-10-24 02:28:45,585 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 02:28:45,586 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:28:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 02:28:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2020-10-24 02:28:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-24 02:28:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-10-24 02:28:45,608 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 58 [2020-10-24 02:28:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:45,608 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-10-24 02:28:45,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:28:45,609 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-10-24 02:28:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 02:28:45,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:45,610 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-10-24 02:28:45,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:28:45,611 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:45,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1759920101, now seen corresponding path program 1 times [2020-10-24 02:28:45,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:45,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022350359] [2020-10-24 02:28:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:45,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:45,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:28:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:28:45,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022350359] [2020-10-24 02:28:45,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:45,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:28:45,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076975456] [2020-10-24 02:28:45,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:28:45,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:28:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:28:45,817 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 10 states. [2020-10-24 02:28:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:46,473 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2020-10-24 02:28:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:28:46,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-10-24 02:28:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:46,475 INFO L225 Difference]: With dead ends: 107 [2020-10-24 02:28:46,475 INFO L226 Difference]: Without dead ends: 103 [2020-10-24 02:28:46,476 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:28:46,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-24 02:28:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2020-10-24 02:28:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-24 02:28:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-10-24 02:28:46,494 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 59 [2020-10-24 02:28:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:46,495 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-10-24 02:28:46,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:28:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-10-24 02:28:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 02:28:46,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:46,496 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2020-10-24 02:28:46,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:28:46,497 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash 155171771, now seen corresponding path program 1 times [2020-10-24 02:28:46,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:46,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144446116] [2020-10-24 02:28:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:46,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:46,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-24 02:28:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:28:46,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144446116] [2020-10-24 02:28:46,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:46,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:28:46,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587818437] [2020-10-24 02:28:46,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:28:46,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:46,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:28:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:28:46,684 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 10 states. [2020-10-24 02:28:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:47,377 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2020-10-24 02:28:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:28:47,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-10-24 02:28:47,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:47,379 INFO L225 Difference]: With dead ends: 105 [2020-10-24 02:28:47,380 INFO L226 Difference]: Without dead ends: 101 [2020-10-24 02:28:47,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:28:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-24 02:28:47,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2020-10-24 02:28:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-24 02:28:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2020-10-24 02:28:47,420 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 59 [2020-10-24 02:28:47,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:47,420 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-10-24 02:28:47,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:28:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2020-10-24 02:28:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 02:28:47,422 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:28:47,422 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:28:47,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:28:47,422 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:28:47,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:28:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash 123956103, now seen corresponding path program 2 times [2020-10-24 02:28:47,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:28:47,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2023842719] [2020-10-24 02:28:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:28:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:47,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:28:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:47,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-10-24 02:28:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:47,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-10-24 02:28:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:28:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 02:28:47,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2023842719] [2020-10-24 02:28:47,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:28:47,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:28:47,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966984590] [2020-10-24 02:28:47,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:28:47,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:28:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:28:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:28:47,573 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 7 states. [2020-10-24 02:28:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:28:47,908 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2020-10-24 02:28:47,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:28:47,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2020-10-24 02:28:47,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:28:47,909 INFO L225 Difference]: With dead ends: 76 [2020-10-24 02:28:47,909 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:28:47,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:28:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:28:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:28:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:28:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:28:47,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2020-10-24 02:28:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:28:47,913 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:28:47,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:28:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:28:47,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:28:47,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:28:47,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:28:48,875 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2020-10-24 02:28:49,027 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2020-10-24 02:28:50,158 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2020-10-24 02:28:50,370 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,371 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,371 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,371 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,371 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,371 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,372 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-10-24 02:28:50,372 INFO L277 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-10-24 02:28:50,373 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,373 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,373 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,373 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,373 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:28:50,373 INFO L274 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-10-24 02:28:50,373 INFO L274 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-10-24 02:28:50,373 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-10-24 02:28:50,374 INFO L274 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-10-24 02:28:50,374 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-10-24 02:28:50,374 INFO L270 CegarLoopResult]: At program point L35-2(line 35) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (= |main_#t~post4| 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,374 INFO L270 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,374 INFO L277 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-10-24 02:28:50,374 INFO L270 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-10-24 02:28:50,374 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 24 52) the Hoare annotation is: true [2020-10-24 02:28:50,374 INFO L270 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (= main_~j~0 0) (= |main_#t~post6| 0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,375 INFO L270 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (= |main_#t~post6| 0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,375 INFO L270 CegarLoopResult]: At program point L40(lines 40 43) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,375 INFO L270 CegarLoopResult]: At program point L40-2(lines 34 44) the Hoare annotation is: (let ((.cse0 (<= 4000 main_~c1~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 10000 main_~c3~0))) (or (and .cse0 (= main_~k~0 0) (= main_~i~0 0) .cse1 .cse2) (and .cse0 (<= 1 main_~i~0) (<= 2000 main_~k~0) .cse1 (<= main_~n~0 1) .cse2))) [2020-10-24 02:28:50,375 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,375 INFO L270 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,376 INFO L270 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,376 INFO L270 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,376 INFO L270 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,376 INFO L270 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,376 INFO L277 CegarLoopResult]: At program point L24(lines 24 52) the Hoare annotation is: true [2020-10-24 02:28:50,376 INFO L270 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,377 INFO L270 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (<= 2000 |main_#t~post7|) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,377 INFO L270 CegarLoopResult]: At program point L49-2(line 49) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= main_~n~0 main_~j~0) (<= 1 main_~i~0) (<= 1999 main_~k~0) (<= 2000 |main_#t~post7|) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,377 INFO L270 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,377 INFO L270 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,377 INFO L277 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: true [2020-10-24 02:28:50,377 INFO L270 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,378 INFO L270 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,378 INFO L270 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,378 INFO L270 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,378 INFO L277 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-10-24 02:28:50,378 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 24 52) the Hoare annotation is: true [2020-10-24 02:28:50,378 INFO L270 CegarLoopResult]: At program point L46-2(lines 46 50) the Hoare annotation is: (let ((.cse0 (<= 4000 main_~c1~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= main_~n~0 1)) (.cse4 (<= 10000 main_~c3~0)) (.cse5 (= main_~j~0 0))) (or (and (<= main_~n~0 main_~j~0) .cse0 .cse1 (<= 1999 main_~k~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 2000 main_~k~0) .cse5 .cse2 .cse3 .cse4) (and (<= main_~n~0 0) (= main_~i~0 0) .cse5))) [2020-10-24 02:28:50,378 INFO L277 CegarLoopResult]: At program point L46-3(lines 46 50) the Hoare annotation is: true [2020-10-24 02:28:50,379 INFO L270 CegarLoopResult]: At program point L38(lines 38 43) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,379 INFO L270 CegarLoopResult]: At program point L34-2(lines 34 44) the Hoare annotation is: (or (and (<= main_~n~0 0) (= main_~i~0 0)) (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0))) [2020-10-24 02:28:50,379 INFO L270 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,379 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 24 52) the Hoare annotation is: true [2020-10-24 02:28:50,379 INFO L270 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,379 INFO L270 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,380 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= 4000 main_~c1~0) [2020-10-24 02:28:50,380 INFO L270 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~j~0 0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,380 INFO L270 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (= main_~j~0 0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,380 INFO L270 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,380 INFO L270 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,380 INFO L270 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (= main_~i~0 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,381 INFO L270 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (= main_~i~0 0) (= |main_#t~post4| 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-10-24 02:28:50,381 INFO L270 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 02:28:50,381 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-10-24 02:28:50,381 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 02:28:50,381 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 02:28:50,381 INFO L270 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 02:28:50,381 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 02:28:50,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:28:50 BoogieIcfgContainer [2020-10-24 02:28:50,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:28:50,416 INFO L168 Benchmark]: Toolchain (without parser) took 10823.73 ms. Allocated memory was 154.1 MB in the beginning and 268.4 MB in the end (delta: 114.3 MB). Free memory was 130.3 MB in the beginning and 243.3 MB in the end (delta: -113.0 MB). Peak memory consumption was 150.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:28:50,417 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 154.1 MB. Free memory is still 128.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:28:50,417 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.94 ms. Allocated memory is still 154.1 MB. Free memory was 129.6 MB in the beginning and 120.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:28:50,418 INFO L168 Benchmark]: Boogie Preprocessor took 38.84 ms. Allocated memory is still 154.1 MB. Free memory was 120.0 MB in the beginning and 118.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:28:50,419 INFO L168 Benchmark]: RCFGBuilder took 639.30 ms. Allocated memory is still 154.1 MB. Free memory was 118.4 MB in the beginning and 130.6 MB in the end (delta: -12.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:28:50,420 INFO L168 Benchmark]: TraceAbstraction took 9771.25 ms. Allocated memory was 154.1 MB in the beginning and 268.4 MB in the end (delta: 114.3 MB). Free memory was 130.1 MB in the beginning and 243.8 MB in the end (delta: -113.8 MB). Peak memory consumption was 148.9 MB. Max. memory is 8.0 GB. [2020-10-24 02:28:50,424 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.29 ms. Allocated memory is still 154.1 MB. Free memory is still 128.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 356.94 ms. Allocated memory is still 154.1 MB. Free memory was 129.6 MB in the beginning and 120.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.84 ms. Allocated memory is still 154.1 MB. Free memory was 120.0 MB in the beginning and 118.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 639.30 ms. Allocated memory is still 154.1 MB. Free memory was 118.4 MB in the beginning and 130.6 MB in the end (delta: -12.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9771.25 ms. Allocated memory was 154.1 MB in the beginning and 268.4 MB in the end (delta: 114.3 MB). Free memory was 130.1 MB in the beginning and 243.8 MB in the end (delta: -113.8 MB). Peak memory consumption was 148.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 34]: Loop Invariant Derived loop invariant: ((((4000 <= c1 && k == 0) && i == 0) && 2000 <= c2) && 10000 <= c3) || (((((4000 <= c1 && 1 <= i) && 2000 <= k) && 2000 <= c2) && n <= 1) && 10000 <= c3) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((n <= j && 4000 <= c1) && 1 <= i) && 1999 <= k) && 2000 <= c2) && n <= 1) && 10000 <= c3) || ((((((4000 <= c1 && 1 <= i) && 2000 <= k) && j == 0) && 2000 <= c2) && n <= 1) && 10000 <= c3)) || ((n <= 0 && i == 0) && j == 0) - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.1s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 630 SDtfs, 910 SDslu, 518 SDs, 0 SdLazy, 2101 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 120 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 158 PreInvPairs, 191 NumberOfFragments, 702 HoareAnnotationTreeSize, 158 FomulaSimplifications, 21383 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 2334 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 78925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 36/50 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...