/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/recursive-simple/id_i20_o20-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:07:28,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:07:28,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:07:28,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:07:28,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:07:28,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:07:28,819 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:07:28,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:07:28,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:07:28,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:07:28,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:07:28,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:07:28,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:07:28,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:07:28,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:07:28,848 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:07:28,849 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:07:28,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:07:28,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:07:28,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:07:28,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:07:28,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:07:28,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:07:28,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:07:28,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:07:28,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:07:28,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:07:28,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:07:28,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:07:28,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:07:28,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:07:28,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:07:28,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:07:28,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:07:28,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:07:28,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:07:28,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:07:28,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:07:28,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:07:28,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:07:28,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:07:28,901 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 05:07:28,925 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:07:28,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:07:28,930 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:07:28,930 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:07:28,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:07:28,931 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:07:28,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:07:28,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:07:28,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:07:28,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:07:28,932 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:07:28,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:07:28,933 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:07:28,933 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:07:28,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:07:28,934 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:07:28,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:07:28,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:07:28,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:07:28,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:07:28,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:07:28,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:07:28,935 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 05:07:29,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:07:29,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:07:29,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:07:29,456 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:07:29,457 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:07:29,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-11-07 05:07:29,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0699ea4a/6c4a8066a22f42f4835de78e4f98b27a/FLAGd7787974f [2020-11-07 05:07:30,283 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:07:30,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i20_o20-2.c [2020-11-07 05:07:30,295 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0699ea4a/6c4a8066a22f42f4835de78e4f98b27a/FLAGd7787974f [2020-11-07 05:07:30,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0699ea4a/6c4a8066a22f42f4835de78e4f98b27a [2020-11-07 05:07:30,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:07:30,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:07:30,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:30,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:07:30,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:07:30,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e56ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30, skipping insertion in model container [2020-11-07 05:07:30,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:07:30,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:07:30,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:30,832 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:07:30,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:07:30,865 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:07:30,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30 WrapperNode [2020-11-07 05:07:30,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:07:30,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:07:30,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:07:30,867 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:07:30,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (1/1) ... [2020-11-07 05:07:30,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:07:30,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:07:30,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:07:30,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:07:30,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (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 05:07:30,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:07:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:07:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:07:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:07:30,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:07:30,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:07:30,982 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:07:30,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:07:30,982 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:07:30,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:07:30,982 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:07:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:07:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:07:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:07:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:07:30,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:07:30,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:07:30,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:07:31,230 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:07:31,231 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:07:31,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:31 BoogieIcfgContainer [2020-11-07 05:07:31,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:07:31,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:07:31,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:07:31,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:07:31,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:07:30" (1/3) ... [2020-11-07 05:07:31,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c773438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:31, skipping insertion in model container [2020-11-07 05:07:31,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:07:30" (2/3) ... [2020-11-07 05:07:31,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c773438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:07:31, skipping insertion in model container [2020-11-07 05:07:31,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:07:31" (3/3) ... [2020-11-07 05:07:31,245 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2020-11-07 05:07:31,266 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:07:31,274 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:07:31,312 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:07:31,363 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:07:31,364 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:07:31,364 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:07:31,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:07:31,364 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:07:31,365 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:07:31,365 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:07:31,366 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:07:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 05:07:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:07:31,402 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:31,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:31,404 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 05:07:31,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:31,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1156842351] [2020-11-07 05:07:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:31,882 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 05:07:31,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1156842351] [2020-11-07 05:07:31,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:07:31,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:07:31,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087195543] [2020-11-07 05:07:31,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:07:31,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:31,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:07:31,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:07:31,918 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 05:07:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:32,464 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 05:07:32,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:32,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:07:32,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:32,478 INFO L225 Difference]: With dead ends: 52 [2020-11-07 05:07:32,479 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 05:07:32,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:32,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 05:07:32,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 05:07:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 05:07:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 05:07:32,544 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 05:07:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:32,545 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 05:07:32,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:07:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 05:07:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 05:07:32,548 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:32,549 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:07:32,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:07:32,549 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 05:07:32,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:32,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306051433] [2020-11-07 05:07:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:32,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:32,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:32,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:07:32,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306051433] [2020-11-07 05:07:32,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:32,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 05:07:32,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925875446] [2020-11-07 05:07:32,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 05:07:32,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:32,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 05:07:32,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 05:07:32,746 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 05:07:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:33,018 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 05:07:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:07:33,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 05:07:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:33,020 INFO L225 Difference]: With dead ends: 44 [2020-11-07 05:07:33,021 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 05:07:33,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 05:07:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 05:07:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 05:07:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 05:07:33,036 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 05:07:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:33,037 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 05:07:33,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 05:07:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 05:07:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 05:07:33,039 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:33,040 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:33,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:07:33,040 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:33,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:33,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 05:07:33,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:33,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1877522155] [2020-11-07 05:07:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:07:33,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1877522155] [2020-11-07 05:07:33,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:33,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 05:07:33,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223295196] [2020-11-07 05:07:33,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 05:07:33,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 05:07:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 05:07:33,261 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 05:07:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:33,586 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 05:07:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 05:07:33,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 05:07:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:33,589 INFO L225 Difference]: With dead ends: 49 [2020-11-07 05:07:33,589 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 05:07:33,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 05:07:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 05:07:33,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 05:07:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 05:07:33,606 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 05:07:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:33,607 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 05:07:33,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 05:07:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 05:07:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 05:07:33,609 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:33,609 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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] [2020-11-07 05:07:33,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:07:33,610 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 05:07:33,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:33,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114020614] [2020-11-07 05:07:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 05:07:33,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114020614] [2020-11-07 05:07:33,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:33,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-11-07 05:07:33,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917060234] [2020-11-07 05:07:33,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:07:33,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:33,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:07:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:07:33,813 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 05:07:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:34,183 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 05:07:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 05:07:34,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 05:07:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:34,186 INFO L225 Difference]: With dead ends: 54 [2020-11-07 05:07:34,186 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 05:07:34,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 05:07:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 05:07:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 05:07:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 05:07:34,202 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 05:07:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:34,202 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 05:07:34,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:07:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 05:07:34,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 05:07:34,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:34,205 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:34,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:07:34,205 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:34,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:34,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 05:07:34,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:34,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1374003135] [2020-11-07 05:07:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 05:07:34,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1374003135] [2020-11-07 05:07:34,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:34,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 05:07:34,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234325381] [2020-11-07 05:07:34,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 05:07:34,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 05:07:34,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:07:34,504 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 05:07:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:34,925 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 05:07:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 05:07:34,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 05:07:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:34,928 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:07:34,928 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 05:07:34,929 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 05:07:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 05:07:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 05:07:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 05:07:34,944 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 05:07:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:34,944 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 05:07:34,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 05:07:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 05:07:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 05:07:34,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:34,946 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:34,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:07:34,947 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 05:07:34,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:34,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1134961770] [2020-11-07 05:07:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 05:07:35,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1134961770] [2020-11-07 05:07:35,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:35,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-11-07 05:07:35,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802717909] [2020-11-07 05:07:35,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:07:35,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:35,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:07:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:07:35,243 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 05:07:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:35,760 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 05:07:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:07:35,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 05:07:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:35,764 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:07:35,764 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 05:07:35,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 05:07:35,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 05:07:35,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:07:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 05:07:35,782 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 05:07:35,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:35,782 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 05:07:35,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:07:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 05:07:35,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 05:07:35,784 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:35,784 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:35,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:07:35,785 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:35,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:35,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 05:07:35,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:35,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1537227787] [2020-11-07 05:07:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:35,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 05:07:36,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1537227787] [2020-11-07 05:07:36,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:36,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:07:36,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991777486] [2020-11-07 05:07:36,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:07:36,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:07:36,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:07:36,161 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 05:07:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:36,733 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 05:07:36,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:07:36,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 05:07:36,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:36,738 INFO L225 Difference]: With dead ends: 69 [2020-11-07 05:07:36,738 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 05:07:36,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 05:07:36,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 05:07:36,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:07:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 05:07:36,757 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 05:07:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:36,758 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 05:07:36,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:07:36,761 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 05:07:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 05:07:36,763 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:36,763 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:36,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:07:36,764 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:36,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:36,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 05:07:36,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:36,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1188305359] [2020-11-07 05:07:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:36,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 05:07:37,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1188305359] [2020-11-07 05:07:37,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:37,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 05:07:37,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981886820] [2020-11-07 05:07:37,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 05:07:37,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:37,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 05:07:37,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 05:07:37,074 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 05:07:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:37,756 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 05:07:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:07:37,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 05:07:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:37,758 INFO L225 Difference]: With dead ends: 74 [2020-11-07 05:07:37,758 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 05:07:37,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 05:07:37,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 05:07:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 05:07:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 05:07:37,795 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 05:07:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:37,796 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 05:07:37,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 05:07:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 05:07:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 05:07:37,801 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:37,801 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:37,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:07:37,802 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 05:07:37,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:37,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935126396] [2020-11-07 05:07:37,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:37,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 05:07:38,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935126396] [2020-11-07 05:07:38,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:38,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-11-07 05:07:38,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381941391] [2020-11-07 05:07:38,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:07:38,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:07:38,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:07:38,228 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 05:07:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:38,867 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 05:07:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 05:07:38,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 05:07:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:38,870 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:07:38,871 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 05:07:38,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 05:07:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 05:07:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 05:07:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 05:07:38,892 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 05:07:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:38,893 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 05:07:38,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:07:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 05:07:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 05:07:38,894 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:38,894 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:38,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:07:38,895 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 05:07:38,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:38,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1820410030] [2020-11-07 05:07:38,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:38,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 05:07:39,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1820410030] [2020-11-07 05:07:39,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:39,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:07:39,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028253951] [2020-11-07 05:07:39,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:07:39,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:39,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:07:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:07:39,349 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 05:07:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:40,063 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 05:07:40,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:07:40,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 05:07:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:40,065 INFO L225 Difference]: With dead ends: 84 [2020-11-07 05:07:40,065 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:07:40,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=472, Unknown=0, NotChecked=0, Total=702 [2020-11-07 05:07:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:07:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 05:07:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 05:07:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 05:07:40,087 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 05:07:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:40,087 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 05:07:40,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:07:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 05:07:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 05:07:40,089 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:40,089 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:07:40,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:07:40,089 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 05:07:40,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:40,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [594905784] [2020-11-07 05:07:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 05:07:40,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [594905784] [2020-11-07 05:07:40,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:40,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 05:07:40,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992036701] [2020-11-07 05:07:40,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 05:07:40,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 05:07:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 05:07:40,599 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-11-07 05:07:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:41,392 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 05:07:41,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 05:07:41,392 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-11-07 05:07:41,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:41,394 INFO L225 Difference]: With dead ends: 89 [2020-11-07 05:07:41,394 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 05:07:41,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 05:07:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 05:07:41,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 05:07:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 05:07:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 05:07:41,413 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 05:07:41,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:41,413 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 05:07:41,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 05:07:41,413 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 05:07:41,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 05:07:41,415 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:41,415 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 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 05:07:41,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:07:41,415 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:41,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 05:07:41,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:41,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294057190] [2020-11-07 05:07:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:41,949 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 05:07:41,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1294057190] [2020-11-07 05:07:41,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:41,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:07:41,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353398678] [2020-11-07 05:07:41,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:07:41,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:41,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:07:41,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:07:41,951 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 05:07:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:42,805 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-11-07 05:07:42,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:07:42,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 05:07:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:42,807 INFO L225 Difference]: With dead ends: 94 [2020-11-07 05:07:42,807 INFO L226 Difference]: Without dead ends: 87 [2020-11-07 05:07:42,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-11-07 05:07:42,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-11-07 05:07:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-11-07 05:07:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-11-07 05:07:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-11-07 05:07:42,830 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-11-07 05:07:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:42,831 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-11-07 05:07:42,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:07:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-11-07 05:07:42,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-07 05:07:42,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:42,837 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 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 05:07:42,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:07:42,837 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-11-07 05:07:42,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:42,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177183211] [2020-11-07 05:07:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:42,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-11-07 05:07:43,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177183211] [2020-11-07 05:07:43,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:43,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-11-07 05:07:43,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699151453] [2020-11-07 05:07:43,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 05:07:43,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:43,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 05:07:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:07:43,477 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-11-07 05:07:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:44,362 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-11-07 05:07:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 05:07:44,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-11-07 05:07:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:44,365 INFO L225 Difference]: With dead ends: 99 [2020-11-07 05:07:44,365 INFO L226 Difference]: Without dead ends: 92 [2020-11-07 05:07:44,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:07:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-07 05:07:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-07 05:07:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 05:07:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-11-07 05:07:44,396 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-11-07 05:07:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:44,397 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-11-07 05:07:44,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 05:07:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-11-07 05:07:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-11-07 05:07:44,401 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:44,401 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 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 05:07:44,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 05:07:44,401 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-11-07 05:07:44,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:44,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847970480] [2020-11-07 05:07:44,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:44,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-11-07 05:07:45,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847970480] [2020-11-07 05:07:45,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:45,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 05:07:45,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096622220] [2020-11-07 05:07:45,128 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 05:07:45,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:45,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 05:07:45,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 05:07:45,129 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-11-07 05:07:46,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:46,118 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 05:07:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 05:07:46,119 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-11-07 05:07:46,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:46,121 INFO L225 Difference]: With dead ends: 104 [2020-11-07 05:07:46,121 INFO L226 Difference]: Without dead ends: 97 [2020-11-07 05:07:46,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 05:07:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-07 05:07:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-11-07 05:07:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-07 05:07:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-11-07 05:07:46,142 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-11-07 05:07:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:46,142 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-11-07 05:07:46,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 05:07:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-11-07 05:07:46,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-11-07 05:07:46,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:46,147 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 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 05:07:46,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 05:07:46,147 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:46,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-11-07 05:07:46,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:46,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396014808] [2020-11-07 05:07:46,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-11-07 05:07:46,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396014808] [2020-11-07 05:07:46,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:46,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-11-07 05:07:46,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086070956] [2020-11-07 05:07:47,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 05:07:47,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:47,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 05:07:47,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:07:47,001 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-11-07 05:07:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:47,994 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-11-07 05:07:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:07:47,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-11-07 05:07:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:47,996 INFO L225 Difference]: With dead ends: 109 [2020-11-07 05:07:47,996 INFO L226 Difference]: Without dead ends: 102 [2020-11-07 05:07:47,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 05:07:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-07 05:07:48,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-11-07 05:07:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-11-07 05:07:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-11-07 05:07:48,013 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-11-07 05:07:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:48,013 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-11-07 05:07:48,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 05:07:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-11-07 05:07:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-11-07 05:07:48,015 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:48,015 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 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 05:07:48,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 05:07:48,016 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:48,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:48,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-11-07 05:07:48,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:48,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1655082807] [2020-11-07 05:07:48,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-11-07 05:07:48,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1655082807] [2020-11-07 05:07:48,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:48,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-11-07 05:07:48,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036807883] [2020-11-07 05:07:48,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-11-07 05:07:48,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:48,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-11-07 05:07:48,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2020-11-07 05:07:48,795 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 21 states. [2020-11-07 05:07:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:49,938 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2020-11-07 05:07:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-07 05:07:49,938 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 145 [2020-11-07 05:07:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:49,940 INFO L225 Difference]: With dead ends: 114 [2020-11-07 05:07:49,940 INFO L226 Difference]: Without dead ends: 107 [2020-11-07 05:07:49,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=979, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 05:07:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-07 05:07:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-07 05:07:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-07 05:07:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2020-11-07 05:07:49,958 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 145 [2020-11-07 05:07:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:49,958 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2020-11-07 05:07:49,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-11-07 05:07:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2020-11-07 05:07:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 05:07:49,960 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:49,961 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 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 05:07:49,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 05:07:49,961 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1314107831, now seen corresponding path program 16 times [2020-11-07 05:07:49,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:49,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2060445535] [2020-11-07 05:07:49,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-11-07 05:07:50,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2060445535] [2020-11-07 05:07:50,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:50,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 05:07:50,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582966753] [2020-11-07 05:07:50,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 05:07:50,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:50,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 05:07:50,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=285, Unknown=0, NotChecked=0, Total=462 [2020-11-07 05:07:50,753 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 22 states. [2020-11-07 05:07:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:51,877 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2020-11-07 05:07:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:07:51,878 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 153 [2020-11-07 05:07:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:51,880 INFO L225 Difference]: With dead ends: 119 [2020-11-07 05:07:51,880 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 05:07:51,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=1081, Unknown=0, NotChecked=0, Total=1640 [2020-11-07 05:07:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 05:07:51,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-07 05:07:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-07 05:07:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2020-11-07 05:07:51,903 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 153 [2020-11-07 05:07:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:51,904 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2020-11-07 05:07:51,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 05:07:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2020-11-07 05:07:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2020-11-07 05:07:51,906 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:51,906 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 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 05:07:51,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-07 05:07:51,906 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:51,907 INFO L82 PathProgramCache]: Analyzing trace with hash -740682093, now seen corresponding path program 17 times [2020-11-07 05:07:51,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:51,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [661531713] [2020-11-07 05:07:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:51,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-11-07 05:07:52,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [661531713] [2020-11-07 05:07:52,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:52,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-11-07 05:07:52,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806571683] [2020-11-07 05:07:52,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-07 05:07:52,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-07 05:07:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=310, Unknown=0, NotChecked=0, Total=506 [2020-11-07 05:07:52,714 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 23 states. [2020-11-07 05:07:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:53,899 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2020-11-07 05:07:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 05:07:53,899 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 161 [2020-11-07 05:07:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:53,901 INFO L225 Difference]: With dead ends: 124 [2020-11-07 05:07:53,901 INFO L226 Difference]: Without dead ends: 117 [2020-11-07 05:07:53,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=618, Invalid=1188, Unknown=0, NotChecked=0, Total=1806 [2020-11-07 05:07:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-11-07 05:07:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-11-07 05:07:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-11-07 05:07:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2020-11-07 05:07:53,926 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 161 [2020-11-07 05:07:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:53,927 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2020-11-07 05:07:53,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-07 05:07:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2020-11-07 05:07:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-11-07 05:07:53,929 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:53,929 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 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 05:07:53,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-07 05:07:53,930 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash 883982985, now seen corresponding path program 18 times [2020-11-07 05:07:53,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:53,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798181830] [2020-11-07 05:07:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-11-07 05:07:54,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798181830] [2020-11-07 05:07:54,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:54,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 05:07:54,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833947624] [2020-11-07 05:07:54,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 05:07:54,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:54,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 05:07:54,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:07:54,893 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 24 states. [2020-11-07 05:07:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:56,201 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2020-11-07 05:07:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-11-07 05:07:56,202 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 169 [2020-11-07 05:07:56,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:56,203 INFO L225 Difference]: With dead ends: 129 [2020-11-07 05:07:56,204 INFO L226 Difference]: Without dead ends: 122 [2020-11-07 05:07:56,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=680, Invalid=1300, Unknown=0, NotChecked=0, Total=1980 [2020-11-07 05:07:56,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-11-07 05:07:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-11-07 05:07:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-11-07 05:07:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2020-11-07 05:07:56,221 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 169 [2020-11-07 05:07:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:56,222 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2020-11-07 05:07:56,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 05:07:56,222 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2020-11-07 05:07:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-11-07 05:07:56,224 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:56,224 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 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 05:07:56,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-07 05:07:56,224 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:56,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:56,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1146598995, now seen corresponding path program 19 times [2020-11-07 05:07:56,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:56,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [868958325] [2020-11-07 05:07:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:07:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 05:07:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:56,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:07:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:07:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-11-07 05:07:57,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [868958325] [2020-11-07 05:07:57,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:07:57,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 05:07:57,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522763085] [2020-11-07 05:07:57,204 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 05:07:57,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:07:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 05:07:57,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=363, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:07:57,205 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 25 states. [2020-11-07 05:07:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:07:58,524 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2020-11-07 05:07:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 05:07:58,525 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 177 [2020-11-07 05:07:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:07:58,527 INFO L225 Difference]: With dead ends: 134 [2020-11-07 05:07:58,527 INFO L226 Difference]: Without dead ends: 127 [2020-11-07 05:07:58,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=745, Invalid=1417, Unknown=0, NotChecked=0, Total=2162 [2020-11-07 05:07:58,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-11-07 05:07:58,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2020-11-07 05:07:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-11-07 05:07:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2020-11-07 05:07:58,544 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 177 [2020-11-07 05:07:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:07:58,545 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2020-11-07 05:07:58,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 05:07:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2020-11-07 05:07:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-11-07 05:07:58,546 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:07:58,547 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 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 05:07:58,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-07 05:07:58,547 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:07:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:07:58,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1952442057, now seen corresponding path program 20 times [2020-11-07 05:07:58,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:07:58,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [624652633] [2020-11-07 05:07:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:07:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:07:58,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:07:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:07:58,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:07:58,672 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:07:58,673 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:07:58,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-07 05:07:58,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:07:58 BoogieIcfgContainer [2020-11-07 05:07:58,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:07:58,758 INFO L168 Benchmark]: Toolchain (without parser) took 28132.09 ms. Allocated memory was 174.1 MB in the beginning and 436.2 MB in the end (delta: 262.1 MB). Free memory was 151.4 MB in the beginning and 223.4 MB in the end (delta: -72.0 MB). Peak memory consumption was 191.3 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:58,759 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory was 96.9 MB in the beginning and 96.8 MB in the end (delta: 67.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:07:58,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.69 ms. Allocated memory is still 174.1 MB. Free memory was 150.7 MB in the beginning and 141.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:58,760 INFO L168 Benchmark]: Boogie Preprocessor took 32.51 ms. Allocated memory is still 174.1 MB. Free memory was 141.7 MB in the beginning and 140.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:58,760 INFO L168 Benchmark]: RCFGBuilder took 332.57 ms. Allocated memory is still 174.1 MB. Free memory was 140.3 MB in the beginning and 126.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:58,761 INFO L168 Benchmark]: TraceAbstraction took 27520.63 ms. Allocated memory was 174.1 MB in the beginning and 436.2 MB in the end (delta: 262.1 MB). Free memory was 126.4 MB in the beginning and 223.4 MB in the end (delta: -97.0 MB). Peak memory consumption was 166.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:07:58,764 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.21 ms. Allocated memory is still 125.8 MB. Free memory was 96.9 MB in the beginning and 96.8 MB in the end (delta: 67.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 233.69 ms. Allocated memory is still 174.1 MB. Free memory was 150.7 MB in the beginning and 141.7 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 32.51 ms. Allocated memory is still 174.1 MB. Free memory was 141.7 MB in the beginning and 140.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 332.57 ms. Allocated memory is still 174.1 MB. Free memory was 140.3 MB in the beginning and 126.8 MB in the end (delta: 13.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27520.63 ms. Allocated memory was 174.1 MB in the beginning and 436.2 MB in the end (delta: 262.1 MB). Free memory was 126.4 MB in the beginning and 223.4 MB in the end (delta: -97.0 MB). Peak memory consumption was 166.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 20; VAL [input=20] [L13] CALL, EXPR id(input) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 VAL [\old(x)=0, x=0] [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L8] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L8] return id(x-1) + 1; VAL [\old(x)=16, \result=16, id(x-1)=15, x=16] [L8] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L8] return id(x-1) + 1; VAL [\old(x)=17, \result=17, id(x-1)=16, x=17] [L8] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L8] return id(x-1) + 1; VAL [\old(x)=18, \result=18, id(x-1)=17, x=18] [L8] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L8] return id(x-1) + 1; VAL [\old(x)=19, \result=19, id(x-1)=18, x=19] [L8] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L8] return id(x-1) + 1; VAL [\old(x)=20, \result=20, id(x-1)=19, x=20] [L13] RET, EXPR id(input) VAL [id(input)=20, input=20] [L13] int result = id(input); VAL [id(input)=20, input=20, result=20] [L14] COND TRUE result == 20 VAL [input=20, result=20] [L15] CALL reach_error() [L4] __assert_fail("0", "id_i20_o20-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.3s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 543 SDtfs, 2095 SDslu, 1236 SDs, 0 SdLazy, 2217 SolverSat, 630 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3083 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 2205 NumberOfCodeBlocks, 2205 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 663088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/9880 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 incorrect! Received shutdown request...