/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/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:39:31,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:39:31,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:39:31,924 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:39:31,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:39:31,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:39:31,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:39:31,941 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:39:31,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:39:31,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:39:31,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:39:31,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:39:31,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:39:31,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:39:31,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:39:31,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:39:31,962 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:39:31,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:39:31,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:39:31,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:39:31,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:39:31,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:39:31,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:39:31,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:39:31,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:39:31,997 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:39:32,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:39:32,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:39:32,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:39:32,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:39:32,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:39:32,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:39:32,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:39:32,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:39:32,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:39:32,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:39:32,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:39:32,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:39:32,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:39:32,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:39:32,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:39:32,014 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:39:32,041 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:39:32,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:39:32,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:39:32,048 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:39:32,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:39:32,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:39:32,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:39:32,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:39:32,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:39:32,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:39:32,050 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:39:32,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:39:32,051 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:39:32,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:39:32,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:39:32,052 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:39:32,052 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:39:32,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:39:32,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:39:32,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:39:32,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:39:32,053 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:39:32,053 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:39:32,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:39:32,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:39:32,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:39:32,597 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:39:32,599 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:39:32,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-11-07 06:39:32,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a9d65f9/aa65cee2f0bd49cf85642eccbd5c0c52/FLAG67c716e3f [2020-11-07 06:39:33,487 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:39:33,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2020-11-07 06:39:33,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a9d65f9/aa65cee2f0bd49cf85642eccbd5c0c52/FLAG67c716e3f [2020-11-07 06:39:33,836 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a9d65f9/aa65cee2f0bd49cf85642eccbd5c0c52 [2020-11-07 06:39:33,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:39:33,848 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:39:33,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:33,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:39:33,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:39:33,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:33" (1/1) ... [2020-11-07 06:39:33,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23bfff77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:33, skipping insertion in model container [2020-11-07 06:39:33,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:33" (1/1) ... [2020-11-07 06:39:33,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:39:33,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:39:34,132 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:34,145 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:39:34,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:34,191 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:39:34,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34 WrapperNode [2020-11-07 06:39:34,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:34,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:39:34,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:39:34,194 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:39:34,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,234 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... [2020-11-07 06:39:34,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:39:34,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:39:34,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:39:34,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:39:34,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:39:34,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:39:34,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:39:34,339 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:39:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:39:34,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:39:34,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:39:34,341 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:39:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:39:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:39:34,342 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:39:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:39:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:39:34,343 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:39:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:39:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:39:34,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:39:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:39:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:39:34,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:39:34,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:39:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:39:34,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:39:35,027 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:39:35,028 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:39:35,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:35 BoogieIcfgContainer [2020-11-07 06:39:35,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:39:35,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:39:35,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:39:35,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:39:35,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:39:33" (1/3) ... [2020-11-07 06:39:35,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a714d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:35, skipping insertion in model container [2020-11-07 06:39:35,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:34" (2/3) ... [2020-11-07 06:39:35,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a714d33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:35, skipping insertion in model container [2020-11-07 06:39:35,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:35" (3/3) ... [2020-11-07 06:39:35,044 INFO L111 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2020-11-07 06:39:35,066 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:39:35,070 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:39:35,086 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:39:35,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:39:35,129 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:39:35,129 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:39:35,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:39:35,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:39:35,130 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:39:35,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:39:35,130 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:39:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-11-07 06:39:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 06:39:35,171 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:35,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:35,173 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1775398781, now seen corresponding path program 1 times [2020-11-07 06:39:35,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:35,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [896279849] [2020-11-07 06:39:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:35,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:35,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [896279849] [2020-11-07 06:39:35,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:35,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 06:39:35,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199505696] [2020-11-07 06:39:35,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 06:39:35,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 06:39:35,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:39:35,628 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-11-07 06:39:35,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:35,814 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2020-11-07 06:39:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 06:39:35,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-07 06:39:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:35,828 INFO L225 Difference]: With dead ends: 106 [2020-11-07 06:39:35,828 INFO L226 Difference]: Without dead ends: 56 [2020-11-07 06:39:35,833 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-11-07 06:39:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-11-07 06:39:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-11-07 06:39:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 06:39:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2020-11-07 06:39:35,910 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 33 [2020-11-07 06:39:35,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:35,911 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2020-11-07 06:39:35,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 06:39:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2020-11-07 06:39:35,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-07 06:39:35,914 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:35,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:35,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:39:35,915 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash -136611355, now seen corresponding path program 1 times [2020-11-07 06:39:35,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:35,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [833316974] [2020-11-07 06:39:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:36,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [833316974] [2020-11-07 06:39:36,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:36,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:39:36,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573891993] [2020-11-07 06:39:36,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:39:36,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:36,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:39:36,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:39:36,180 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2020-11-07 06:39:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:36,899 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2020-11-07 06:39:36,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 06:39:36,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-11-07 06:39:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:36,913 INFO L225 Difference]: With dead ends: 77 [2020-11-07 06:39:36,913 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 06:39:36,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 06:39:36,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-11-07 06:39:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 06:39:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2020-11-07 06:39:36,953 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 35 [2020-11-07 06:39:36,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:36,953 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2020-11-07 06:39:36,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:39:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-11-07 06:39:36,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-07 06:39:36,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:36,956 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:36,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:39:36,956 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1196890534, now seen corresponding path program 1 times [2020-11-07 06:39:36,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:36,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [790255817] [2020-11-07 06:39:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 06:39:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:37,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [790255817] [2020-11-07 06:39:37,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:37,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:39:37,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200293338] [2020-11-07 06:39:37,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:39:37,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:39:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:39:37,101 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2020-11-07 06:39:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:37,684 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2020-11-07 06:39:37,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:39:37,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2020-11-07 06:39:37,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:37,687 INFO L225 Difference]: With dead ends: 81 [2020-11-07 06:39:37,687 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 06:39:37,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 06:39:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2020-11-07 06:39:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-07 06:39:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2020-11-07 06:39:37,714 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 40 [2020-11-07 06:39:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:37,715 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2020-11-07 06:39:37,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:39:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2020-11-07 06:39:37,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-07 06:39:37,717 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:37,717 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:37,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:39:37,718 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash 132999514, now seen corresponding path program 1 times [2020-11-07 06:39:37,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:37,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1456967624] [2020-11-07 06:39:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 06:39:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-07 06:39:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:39:37,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1456967624] [2020-11-07 06:39:37,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:37,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:39:37,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106958003] [2020-11-07 06:39:37,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:37,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:37,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:37,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:37,862 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 8 states. [2020-11-07 06:39:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:38,518 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2020-11-07 06:39:38,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:39:38,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-11-07 06:39:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:38,523 INFO L225 Difference]: With dead ends: 88 [2020-11-07 06:39:38,524 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 06:39:38,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:39:38,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 06:39:38,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2020-11-07 06:39:38,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 06:39:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2020-11-07 06:39:38,579 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 48 [2020-11-07 06:39:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:38,580 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2020-11-07 06:39:38,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2020-11-07 06:39:38,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-07 06:39:38,585 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:38,586 INFO L422 BasicCegarLoop]: trace histogram [4, 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] [2020-11-07 06:39:38,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:39:38,586 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2088261755, now seen corresponding path program 1 times [2020-11-07 06:39:38,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:38,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2033419103] [2020-11-07 06:39:38,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 06:39:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-07 06:39:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-07 06:39:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:39:38,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2033419103] [2020-11-07 06:39:38,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:38,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:39:38,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186365807] [2020-11-07 06:39:38,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:39:38,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:38,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:39:38,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:39:38,798 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 9 states. [2020-11-07 06:39:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:39,481 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2020-11-07 06:39:39,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:39:39,481 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2020-11-07 06:39:39,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:39,483 INFO L225 Difference]: With dead ends: 92 [2020-11-07 06:39:39,483 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 06:39:39,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:39:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 06:39:39,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2020-11-07 06:39:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-11-07 06:39:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2020-11-07 06:39:39,503 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 53 [2020-11-07 06:39:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:39,503 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2020-11-07 06:39:39,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:39:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2020-11-07 06:39:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 06:39:39,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:39,505 INFO L422 BasicCegarLoop]: trace histogram [3, 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] [2020-11-07 06:39:39,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:39:39,505 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash -15556804, now seen corresponding path program 1 times [2020-11-07 06:39:39,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:39,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1025083408] [2020-11-07 06:39:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:39:39,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1025083408] [2020-11-07 06:39:39,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:39,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:39:39,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907876801] [2020-11-07 06:39:39,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:39,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:39,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:39,664 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 8 states. [2020-11-07 06:39:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:40,343 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2020-11-07 06:39:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:39:40,344 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2020-11-07 06:39:40,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:40,346 INFO L225 Difference]: With dead ends: 105 [2020-11-07 06:39:40,346 INFO L226 Difference]: Without dead ends: 101 [2020-11-07 06:39:40,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:39:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-07 06:39:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2020-11-07 06:39:40,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-11-07 06:39:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2020-11-07 06:39:40,387 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 52 [2020-11-07 06:39:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:40,387 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2020-11-07 06:39:40,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2020-11-07 06:39:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 06:39:40,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:40,395 INFO L422 BasicCegarLoop]: trace histogram [4, 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] [2020-11-07 06:39:40,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:39:40,395 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:40,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2032807907, now seen corresponding path program 1 times [2020-11-07 06:39:40,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:40,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1376466191] [2020-11-07 06:39:40,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-07 06:39:40,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1376466191] [2020-11-07 06:39:40,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:40,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 06:39:40,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131912898] [2020-11-07 06:39:40,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:40,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:40,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:40,646 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 10 states. [2020-11-07 06:39:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:41,461 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2020-11-07 06:39:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:39:41,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 06:39:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:41,464 INFO L225 Difference]: With dead ends: 109 [2020-11-07 06:39:41,465 INFO L226 Difference]: Without dead ends: 105 [2020-11-07 06:39:41,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:39:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-07 06:39:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2020-11-07 06:39:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 06:39:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2020-11-07 06:39:41,496 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 57 [2020-11-07 06:39:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:41,497 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2020-11-07 06:39:41,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2020-11-07 06:39:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 06:39:41,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:41,500 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2020-11-07 06:39:41,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:39:41,501 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1727226990, now seen corresponding path program 1 times [2020-11-07 06:39:41,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:41,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626381077] [2020-11-07 06:39:41,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:41,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:41,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:41,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:41,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:41,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-07 06:39:41,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626381077] [2020-11-07 06:39:41,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:41,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:41,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399523507] [2020-11-07 06:39:41,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:41,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:41,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:41,657 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 8 states. [2020-11-07 06:39:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:42,320 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2020-11-07 06:39:42,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:39:42,321 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2020-11-07 06:39:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:42,322 INFO L225 Difference]: With dead ends: 107 [2020-11-07 06:39:42,322 INFO L226 Difference]: Without dead ends: 103 [2020-11-07 06:39:42,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-11-07 06:39:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-07 06:39:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2020-11-07 06:39:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 06:39:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2020-11-07 06:39:42,380 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 65 [2020-11-07 06:39:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:42,381 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2020-11-07 06:39:42,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2020-11-07 06:39:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 06:39:42,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:42,382 INFO L422 BasicCegarLoop]: trace histogram [6, 5, 5, 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-11-07 06:39:42,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:39:42,383 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1471883633, now seen corresponding path program 1 times [2020-11-07 06:39:42,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:42,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [408145440] [2020-11-07 06:39:42,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 06:39:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 06:39:42,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [408145440] [2020-11-07 06:39:42,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:42,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 06:39:42,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367833994] [2020-11-07 06:39:42,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:39:42,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:42,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:39:42,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:39:42,598 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 9 states. [2020-11-07 06:39:43,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:43,350 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2020-11-07 06:39:43,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:39:43,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2020-11-07 06:39:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:43,355 INFO L225 Difference]: With dead ends: 111 [2020-11-07 06:39:43,356 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 06:39:43,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:39:43,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 06:39:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2020-11-07 06:39:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-11-07 06:39:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2020-11-07 06:39:43,389 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 70 [2020-11-07 06:39:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:43,390 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2020-11-07 06:39:43,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:39:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2020-11-07 06:39:43,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 06:39:43,393 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:43,393 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2020-11-07 06:39:43,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:39:43,393 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1338858127, now seen corresponding path program 1 times [2020-11-07 06:39:43,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:43,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088232545] [2020-11-07 06:39:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 06:39:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:39:43,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088232545] [2020-11-07 06:39:43,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:43,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:43,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415196334] [2020-11-07 06:39:43,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:43,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:43,652 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 10 states. [2020-11-07 06:39:44,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:44,513 INFO L93 Difference]: Finished difference Result 118 states and 130 transitions. [2020-11-07 06:39:44,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:44,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-07 06:39:44,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:44,516 INFO L225 Difference]: With dead ends: 118 [2020-11-07 06:39:44,516 INFO L226 Difference]: Without dead ends: 114 [2020-11-07 06:39:44,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:39:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-11-07 06:39:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-11-07 06:39:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-11-07 06:39:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2020-11-07 06:39:44,554 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 78 [2020-11-07 06:39:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:44,555 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2020-11-07 06:39:44,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2020-11-07 06:39:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-07 06:39:44,562 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:44,563 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 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, 1, 1, 1] [2020-11-07 06:39:44,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:39:44,563 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:44,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:44,564 INFO L82 PathProgramCache]: Analyzing trace with hash -932748850, now seen corresponding path program 1 times [2020-11-07 06:39:44,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:44,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051737059] [2020-11-07 06:39:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 06:39:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-07 06:39:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-07 06:39:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:39:44,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051737059] [2020-11-07 06:39:44,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:44,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:39:44,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835203535] [2020-11-07 06:39:44,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:39:44,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:44,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:39:44,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:39:44,963 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 13 states. [2020-11-07 06:39:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:46,291 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2020-11-07 06:39:46,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:39:46,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2020-11-07 06:39:46,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:46,293 INFO L225 Difference]: With dead ends: 122 [2020-11-07 06:39:46,293 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 06:39:46,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:39:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 06:39:46,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2020-11-07 06:39:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-11-07 06:39:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2020-11-07 06:39:46,328 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 83 [2020-11-07 06:39:46,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:46,329 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2020-11-07 06:39:46,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:39:46,329 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2020-11-07 06:39:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-07 06:39:46,330 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:46,330 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:46,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:39:46,331 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1268643795, now seen corresponding path program 1 times [2020-11-07 06:39:46,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:46,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145761349] [2020-11-07 06:39:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-11-07 06:39:46,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1145761349] [2020-11-07 06:39:46,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:46,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:46,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523383210] [2020-11-07 06:39:46,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:46,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:46,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:46,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:46,535 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 10 states. [2020-11-07 06:39:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:47,380 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2020-11-07 06:39:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:47,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2020-11-07 06:39:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:47,383 INFO L225 Difference]: With dead ends: 113 [2020-11-07 06:39:47,383 INFO L226 Difference]: Without dead ends: 109 [2020-11-07 06:39:47,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:39:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-07 06:39:47,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 104. [2020-11-07 06:39:47,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 06:39:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2020-11-07 06:39:47,411 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 82 [2020-11-07 06:39:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:47,411 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2020-11-07 06:39:47,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2020-11-07 06:39:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-07 06:39:47,413 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:47,413 INFO L422 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:47,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 06:39:47,413 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash 2007080364, now seen corresponding path program 2 times [2020-11-07 06:39:47,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:47,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1344823189] [2020-11-07 06:39:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-07 06:39:47,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1344823189] [2020-11-07 06:39:47,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:47,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:39:47,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390293019] [2020-11-07 06:39:47,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:39:47,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:47,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:39:47,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:47,642 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 12 states. [2020-11-07 06:39:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:48,816 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2020-11-07 06:39:48,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:39:48,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 87 [2020-11-07 06:39:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:48,818 INFO L225 Difference]: With dead ends: 139 [2020-11-07 06:39:48,818 INFO L226 Difference]: Without dead ends: 135 [2020-11-07 06:39:48,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2020-11-07 06:39:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-07 06:39:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2020-11-07 06:39:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-11-07 06:39:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2020-11-07 06:39:48,843 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 87 [2020-11-07 06:39:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:48,843 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2020-11-07 06:39:48,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:39:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2020-11-07 06:39:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-07 06:39:48,845 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:48,845 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:48,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 06:39:48,845 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1956054729, now seen corresponding path program 2 times [2020-11-07 06:39:48,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:48,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [683284089] [2020-11-07 06:39:48,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:48,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 06:39:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2020-11-07 06:39:49,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [683284089] [2020-11-07 06:39:49,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:49,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:49,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316292820] [2020-11-07 06:39:49,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:49,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:49,005 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 10 states. [2020-11-07 06:39:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:49,829 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2020-11-07 06:39:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:39:49,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2020-11-07 06:39:49,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:49,834 INFO L225 Difference]: With dead ends: 124 [2020-11-07 06:39:49,834 INFO L226 Difference]: Without dead ends: 120 [2020-11-07 06:39:49,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-11-07 06:39:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-11-07 06:39:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-11-07 06:39:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-11-07 06:39:49,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2020-11-07 06:39:49,859 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 95 [2020-11-07 06:39:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:49,860 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2020-11-07 06:39:49,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2020-11-07 06:39:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-07 06:39:49,861 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:49,862 INFO L422 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:49,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 06:39:49,862 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:49,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1734333880, now seen corresponding path program 2 times [2020-11-07 06:39:49,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:49,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698189492] [2020-11-07 06:39:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 06:39:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 06:39:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2020-11-07 06:39:50,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698189492] [2020-11-07 06:39:50,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:50,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:39:50,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157971891] [2020-11-07 06:39:50,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:39:50,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:50,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:39:50,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:39:50,163 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 13 states. [2020-11-07 06:39:50,804 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-11-07 06:39:51,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:51,483 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2020-11-07 06:39:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:39:51,484 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2020-11-07 06:39:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:51,486 INFO L225 Difference]: With dead ends: 141 [2020-11-07 06:39:51,486 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 06:39:51,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2020-11-07 06:39:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 06:39:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2020-11-07 06:39:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-11-07 06:39:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2020-11-07 06:39:51,517 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 100 [2020-11-07 06:39:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:51,517 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2020-11-07 06:39:51,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:39:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2020-11-07 06:39:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 06:39:51,519 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:51,519 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:51,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 06:39:51,520 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1047470264, now seen corresponding path program 2 times [2020-11-07 06:39:51,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:51,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330477299] [2020-11-07 06:39:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 06:39:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 06:39:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 06:39:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 28 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2020-11-07 06:39:51,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330477299] [2020-11-07 06:39:51,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:51,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:39:51,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882324834] [2020-11-07 06:39:51,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:39:51,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:51,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:39:51,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:51,737 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand 12 states. [2020-11-07 06:39:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:52,779 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2020-11-07 06:39:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:39:52,780 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 108 [2020-11-07 06:39:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:52,782 INFO L225 Difference]: With dead ends: 141 [2020-11-07 06:39:52,782 INFO L226 Difference]: Without dead ends: 137 [2020-11-07 06:39:52,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:39:52,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-11-07 06:39:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-11-07 06:39:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-11-07 06:39:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2020-11-07 06:39:52,809 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 108 [2020-11-07 06:39:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:52,810 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2020-11-07 06:39:52,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:39:52,810 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2020-11-07 06:39:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 06:39:52,811 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:52,812 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:52,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 06:39:52,812 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1796819369, now seen corresponding path program 2 times [2020-11-07 06:39:52,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:52,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1274965489] [2020-11-07 06:39:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:53,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 06:39:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2020-11-07 06:39:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-11-07 06:39:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-07 06:39:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2020-11-07 06:39:53,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1274965489] [2020-11-07 06:39:53,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:53,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:39:53,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919459353] [2020-11-07 06:39:53,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:39:53,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:53,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:39:53,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:39:53,112 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 13 states. [2020-11-07 06:39:54,114 WARN L194 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-11-07 06:39:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:54,529 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2020-11-07 06:39:54,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:39:54,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2020-11-07 06:39:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:54,534 INFO L225 Difference]: With dead ends: 149 [2020-11-07 06:39:54,534 INFO L226 Difference]: Without dead ends: 125 [2020-11-07 06:39:54,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2020-11-07 06:39:54,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-11-07 06:39:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-11-07 06:39:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-11-07 06:39:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2020-11-07 06:39:54,575 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 113 [2020-11-07 06:39:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:54,575 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2020-11-07 06:39:54,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:39:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2020-11-07 06:39:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 06:39:54,580 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:54,580 INFO L422 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:54,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 06:39:54,581 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1813936715, now seen corresponding path program 3 times [2020-11-07 06:39:54,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:54,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [627692947] [2020-11-07 06:39:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 06:39:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-07 06:39:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-07 06:39:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:54,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:39:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2020-11-07 06:39:55,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [627692947] [2020-11-07 06:39:55,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:55,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 06:39:55,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003284150] [2020-11-07 06:39:55,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 06:39:55,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 06:39:55,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:39:55,039 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 19 states. [2020-11-07 06:39:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:56,585 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2020-11-07 06:39:56,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:39:56,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117 [2020-11-07 06:39:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:56,588 INFO L225 Difference]: With dead ends: 131 [2020-11-07 06:39:56,588 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 06:39:56,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2020-11-07 06:39:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 06:39:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 06:39:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 06:39:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2020-11-07 06:39:56,616 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 117 [2020-11-07 06:39:56,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:56,617 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2020-11-07 06:39:56,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 06:39:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2020-11-07 06:39:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2020-11-07 06:39:56,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:56,619 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2020-11-07 06:39:56,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 06:39:56,619 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1975166753, now seen corresponding path program 3 times [2020-11-07 06:39:56,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:56,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [550738352] [2020-11-07 06:39:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:39:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-07 06:39:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-07 06:39:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:39:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-07 06:39:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:39:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-07 06:39:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-11-07 06:39:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-11-07 06:39:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-11-07 06:39:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:39:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-11-07 06:39:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2020-11-07 06:39:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 52 proven. 54 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2020-11-07 06:39:56,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [550738352] [2020-11-07 06:39:56,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:56,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:39:56,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981237764] [2020-11-07 06:39:56,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:39:56,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:39:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:39:56,894 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 13 states. [2020-11-07 06:39:57,868 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-11-07 06:39:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:58,200 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2020-11-07 06:39:58,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:39:58,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2020-11-07 06:39:58,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:58,202 INFO L225 Difference]: With dead ends: 127 [2020-11-07 06:39:58,202 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:39:58,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2020-11-07 06:39:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:39:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:39:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:39:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:39:58,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 130 [2020-11-07 06:39:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:58,205 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:39:58,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:39:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:39:58,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:39:58,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 06:39:58,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:39:58,343 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 94 [2020-11-07 06:39:59,188 WARN L194 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 78 [2020-11-07 06:39:59,664 WARN L194 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 33 [2020-11-07 06:39:59,865 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-11-07 06:39:59,977 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2020-11-07 06:40:00,084 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 21 [2020-11-07 06:40:00,339 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-11-07 06:40:00,517 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-11-07 06:40:00,788 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-11-07 06:40:01,110 WARN L194 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 27 [2020-11-07 06:40:01,459 WARN L194 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 27 [2020-11-07 06:40:01,696 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2020-11-07 06:40:01,951 WARN L194 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 31 [2020-11-07 06:40:02,424 WARN L194 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 26 [2020-11-07 06:40:02,535 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 20 [2020-11-07 06:40:02,674 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 20 [2020-11-07 06:40:02,869 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 28 [2020-11-07 06:40:03,130 WARN L194 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 34 [2020-11-07 06:40:03,151 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,151 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,151 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,152 INFO L262 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-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:40:03,153 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:40:03,153 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:40:03,153 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:40:03,153 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:40:03,153 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:40:03,153 INFO L269 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-11-07 06:40:03,154 INFO L262 CegarLoopResult]: At program point L31-1(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-11-07 06:40:03,154 INFO L269 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-11-07 06:40:03,154 INFO L269 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-11-07 06:40:03,154 INFO L269 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-11-07 06:40:03,154 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 56) the Hoare annotation is: true [2020-11-07 06:40:03,154 INFO L262 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (<= 1 main_~buf~0) (<= (+ main_~buf~0 1) main_~bufferlen~0)) [2020-11-07 06:40:03,154 INFO L262 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 2 main_~bufferlen~0)) [2020-11-07 06:40:03,155 INFO L262 CegarLoopResult]: At program point L44(lines 44 45) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= .cse4 main_~bufferlen~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 2 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 2) (+ main_~buf~0 main_~inlen~0)) .cse1 .cse2 (<= 1 main_~in~0) .cse3) (and (<= 1 main_~buf~0) .cse0 (= main_~in~0 0) .cse1 .cse2 .cse3)))) [2020-11-07 06:40:03,155 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-11-07 06:40:03,155 INFO L262 CegarLoopResult]: At program point L32(lines 25 56) the Hoare annotation is: (<= 2 main_~bufferlen~0) [2020-11-07 06:40:03,155 INFO L269 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-11-07 06:40:03,155 INFO L269 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-11-07 06:40:03,155 INFO L269 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-11-07 06:40:03,155 INFO L269 CegarLoopResult]: At program point L53(line 53) the Hoare annotation is: true [2020-11-07 06:40:03,155 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse5)) (.cse1 (<= .cse5 main_~bufferlen~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 (= |main_#t~post7| 0) (= main_~in~0 0) .cse1 .cse2 .cse3) (let ((.cse4 (+ main_~buf~0 main_~inlen~0))) (and .cse0 (<= 2 main_~buf~0) (<= 1 |main_#t~post7|) (<= (+ main_~in~0 main_~bufferlen~0 2) .cse4) .cse1 .cse2 (<= 1 main_~in~0) .cse3 (<= (+ |main_#t~post7| main_~bufferlen~0 2) .cse4)))))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse6 (+ main_~buflim~0 2)) (.cse5 (+ main_~buf~0 main_~inlen~0))) (let ((.cse0 (<= (+ main_~in~0 main_~bufferlen~0 1) .cse5)) (.cse1 (<= main_~bufferlen~0 .cse6)) (.cse2 (<= .cse6 main_~bufferlen~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) .cse0 .cse1 (= |main_#t~post7| 0) .cse2 .cse3 (<= 1 main_~in~0) .cse4) (and .cse0 .cse1 (<= 2 main_~buf~0) (<= 2 main_~in~0) (<= 1 |main_#t~post7|) .cse2 .cse3 .cse4 (<= (+ |main_#t~post7| main_~bufferlen~0 2) .cse5))))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (= main_~in~0 0) .cse1 (< 0 main_~buflim~0) (= main_~buf~0 0) .cse2) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) .cse1 (<= 1 main_~in~0) .cse2)))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (= main_~in~0 0) .cse1 (< 0 main_~buflim~0) (= main_~buf~0 0) .cse2) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) .cse1 (<= 1 main_~in~0) .cse2)))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L37-1(lines 37 48) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-11-07 06:40:03,156 INFO L262 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-11-07 06:40:03,157 INFO L262 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-11-07 06:40:03,157 INFO L262 CegarLoopResult]: At program point L37-5(lines 37 48) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-11-07 06:40:03,157 INFO L269 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-11-07 06:40:03,157 INFO L269 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: true [2020-11-07 06:40:03,157 INFO L269 CegarLoopResult]: At program point L54-1(line 54) the Hoare annotation is: true [2020-11-07 06:40:03,157 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-11-07 06:40:03,157 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-11-07 06:40:03,157 INFO L262 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) (<= main_~bufferlen~0 .cse0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0))) [2020-11-07 06:40:03,157 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 56) the Hoare annotation is: true [2020-11-07 06:40:03,158 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse2 (<= .cse4 main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (= main_~in~0 0) .cse1 .cse2 (= main_~buf~0 0) .cse3) (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 .cse2 (<= 1 main_~in~0) .cse3)))) [2020-11-07 06:40:03,158 INFO L269 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-11-07 06:40:03,158 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2020-11-07 06:40:03,158 INFO L269 CegarLoopResult]: At program point L55(lines 25 56) the Hoare annotation is: true [2020-11-07 06:40:03,158 INFO L262 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (or (and (<= 1 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= (+ |main_#t~post8| 2) main_~bufferlen~0) (<= 1 |main_#t~post8|)) (and (= |main_#t~post8| 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0))) [2020-11-07 06:40:03,159 INFO L262 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (let ((.cse0 (<= (+ main_~buf~0 1) main_~bufferlen~0))) (or (and (<= 2 main_~buf~0) (<= 3 main_~inlen~0) (<= (+ |main_#t~post8| 2) main_~bufferlen~0) .cse0 (<= 1 |main_#t~post8|)) (and (<= 1 main_~buf~0) (= |main_#t~post8| 0) .cse0))) [2020-11-07 06:40:03,159 INFO L262 CegarLoopResult]: At program point L47(lines 37 48) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-11-07 06:40:03,159 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (let ((.cse5 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse5)) (.cse2 (<= (+ main_~buf~0 3) main_~bufferlen~0)) (.cse3 (<= .cse5 main_~bufferlen~0)) (.cse4 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (let ((.cse0 (+ main_~in~0 main_~bufferlen~0 1))) (and (<= 1 main_~buf~0) (<= .cse0 (+ main_~buf~0 main_~inlen~0)) .cse1 (<= .cse0 (+ |main_#t~post6| main_~inlen~0)) .cse2 .cse3 (<= 1 |main_#t~post6|) (<= 1 main_~in~0) .cse4 (<= (+ |main_#t~post6| 3) main_~bufferlen~0))) (and .cse1 (= main_~in~0 0) .cse2 .cse3 (= |main_#t~post6| 0) (= main_~buf~0 0) .cse4)))) [2020-11-07 06:40:03,159 INFO L262 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= .cse4 main_~bufferlen~0)) (.cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0)) (.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and .cse0 (<= 2 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ |main_#t~post6| main_~inlen~0)) (<= (+ main_~in~0 main_~bufferlen~0 2) (+ main_~buf~0 main_~inlen~0)) .cse1 .cse2 (<= 1 |main_#t~post6|) (<= 1 main_~in~0) .cse3 (<= (+ |main_#t~post6| 3) main_~bufferlen~0)) (and (<= 1 main_~buf~0) .cse0 (= main_~in~0 0) .cse1 (= |main_#t~post6| 0) .cse2 .cse3)))) [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point L39(lines 39 40) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse1 (<= .cse3 main_~bufferlen~0)) (.cse2 (<= (+ main_~bufferlen~0 1) main_~inlen~0))) (or (and (<= 1 main_~buf~0) (<= (+ main_~in~0 main_~bufferlen~0 1) (+ main_~buf~0 main_~inlen~0)) .cse0 .cse1 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 1 main_~in~0) .cse2) (and .cse0 (= main_~in~0 0) .cse1 (or (< 0 main_~buflim~0) (= main_~buflim~0 0)) (= main_~buf~0 0) .cse2)))) [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (= main_~buf~0 0) (<= 2 main_~bufferlen~0) (<= (+ main_~bufferlen~0 1) main_~inlen~0)) [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-11-07 06:40:03,160 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-11-07 06:40:03,160 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:40:03,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:40:03 BoogieIcfgContainer [2020-11-07 06:40:03,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:40:03,185 INFO L168 Benchmark]: Toolchain (without parser) took 29343.04 ms. Allocated memory was 158.3 MB in the beginning and 331.4 MB in the end (delta: 173.0 MB). Free memory was 134.9 MB in the beginning and 259.7 MB in the end (delta: -124.8 MB). Peak memory consumption was 193.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:03,186 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 125.8 MB. Free memory is still 95.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:40:03,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.59 ms. Allocated memory is still 158.3 MB. Free memory was 134.2 MB in the beginning and 124.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:03,187 INFO L168 Benchmark]: Boogie Preprocessor took 44.69 ms. Allocated memory is still 158.3 MB. Free memory was 124.4 MB in the beginning and 123.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:03,187 INFO L168 Benchmark]: RCFGBuilder took 792.23 ms. Allocated memory is still 158.3 MB. Free memory was 122.8 MB in the beginning and 135.6 MB in the end (delta: -12.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:03,188 INFO L168 Benchmark]: TraceAbstraction took 28148.18 ms. Allocated memory was 158.3 MB in the beginning and 331.4 MB in the end (delta: 173.0 MB). Free memory was 135.2 MB in the beginning and 259.7 MB in the end (delta: -124.5 MB). Peak memory consumption was 192.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:40:03,190 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.32 ms. Allocated memory is still 125.8 MB. Free memory is still 95.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 342.59 ms. Allocated memory is still 158.3 MB. Free memory was 134.2 MB in the beginning and 124.4 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.69 ms. Allocated memory is still 158.3 MB. Free memory was 124.4 MB in the beginning and 123.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 792.23 ms. Allocated memory is still 158.3 MB. Free memory was 122.8 MB in the beginning and 135.6 MB in the end (delta: -12.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28148.18 ms. Allocated memory was 158.3 MB in the beginning and 331.4 MB in the end (delta: 173.0 MB). Free memory was 135.2 MB in the beginning and 259.7 MB in the end (delta: -124.5 MB). Peak memory consumption was 192.5 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: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((1 <= buf && in + bufferlen + 1 <= buf + inlen) && bufferlen <= buflim + 2) && buflim + 2 <= bufferlen) && buf + 2 <= bufferlen) && 1 <= in) && bufferlen + 1 <= inlen) || (((((bufferlen <= buflim + 2 && in == 0) && buflim + 2 <= bufferlen) && (0 < buflim || buflim == 0)) && buf == 0) && bufferlen + 1 <= inlen) - 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 || \old(cond) == cond - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 23.0s, OverallIterations: 19, TraceHistogramMax: 14, AutomataDifference: 17.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1066 SDtfs, 1766 SDslu, 2361 SDs, 0 SdLazy, 6543 SolverSat, 932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 97 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 410 PreInvPairs, 573 NumberOfFragments, 1195 HoareAnnotationTreeSize, 410 FomulaSimplifications, 1219267 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 68 FomulaSimplificationsInter, 4347 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1446 NumberOfCodeBlocks, 1446 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1427 ConstructedInterpolants, 0 QuantifiedInterpolants, 389645 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 1805/1985 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...