/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_15x0-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:43:24,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:43:24,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:43:24,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:43:24,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:43:24,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:43:24,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:43:25,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:43:25,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:43:25,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:43:25,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:43:25,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:43:25,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:43:25,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:43:25,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:43:25,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:43:25,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:43:25,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:43:25,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:43:25,045 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:43:25,047 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:43:25,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:43:25,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:43:25,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:43:25,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:43:25,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:43:25,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:43:25,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:43:25,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:43:25,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:43:25,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:43:25,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:43:25,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:43:25,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:43:25,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:43:25,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:43:25,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:43:25,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:43:25,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:43:25,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:43:25,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:43:25,079 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 00:43:25,103 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:43:25,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:43:25,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:43:25,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:43:25,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:43:25,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:43:25,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:43:25,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:43:25,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:43:25,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:43:25,111 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:43:25,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:43:25,112 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:43:25,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:43:25,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:43:25,112 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:43:25,113 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:43:25,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:43:25,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:43:25,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:43:25,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:43:25,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:43:25,114 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 [2020-11-07 00:43:25,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:43:25,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:43:25,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:43:25,595 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:43:25,595 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:43:25,596 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-11-07 00:43:25,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed1a279e/13e45acc9bc147fb97ccb678439e5ee6/FLAG0627a67dc [2020-11-07 00:43:26,233 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:43:26,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/sum_15x0-1.c [2020-11-07 00:43:26,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed1a279e/13e45acc9bc147fb97ccb678439e5ee6/FLAG0627a67dc [2020-11-07 00:43:26,605 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed1a279e/13e45acc9bc147fb97ccb678439e5ee6 [2020-11-07 00:43:26,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:43:26,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:43:26,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:26,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:43:26,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:43:26,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61556a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26, skipping insertion in model container [2020-11-07 00:43:26,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:43:26,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:43:26,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:26,843 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:43:26,860 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:43:26,877 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:43:26,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26 WrapperNode [2020-11-07 00:43:26,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:43:26,879 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:43:26,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:43:26,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:43:26,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (1/1) ... [2020-11-07 00:43:26,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:43:26,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:43:26,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:43:26,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:43:26,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (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 00:43:26,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:43:26,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:43:26,994 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:43:26,995 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-11-07 00:43:26,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:43:26,995 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:43:26,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:43:26,995 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:43:26,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:43:26,996 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-11-07 00:43:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:43:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:43:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:43:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:43:26,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:43:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:43:26,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:43:27,271 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:43:27,272 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:43:27,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:27 BoogieIcfgContainer [2020-11-07 00:43:27,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:43:27,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:43:27,277 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:43:27,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:43:27,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:43:26" (1/3) ... [2020-11-07 00:43:27,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b5066f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:27, skipping insertion in model container [2020-11-07 00:43:27,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:43:26" (2/3) ... [2020-11-07 00:43:27,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b5066f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:43:27, skipping insertion in model container [2020-11-07 00:43:27,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:43:27" (3/3) ... [2020-11-07 00:43:27,285 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_15x0-1.c [2020-11-07 00:43:27,303 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:43:27,308 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:43:27,334 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:43:27,367 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:43:27,367 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:43:27,367 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:43:27,368 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:43:27,368 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:43:27,368 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:43:27,368 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:43:27,368 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:43:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2020-11-07 00:43:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-07 00:43:27,406 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:27,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:27,407 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:27,416 INFO L82 PathProgramCache]: Analyzing trace with hash -342472451, now seen corresponding path program 1 times [2020-11-07 00:43:27,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:27,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [688143658] [2020-11-07 00:43:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:27,593 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:27,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,083 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 00:43:28,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [688143658] [2020-11-07 00:43:28,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:28,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:43:28,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056063220] [2020-11-07 00:43:28,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:43:28,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:43:28,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:43:28,123 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 6 states. [2020-11-07 00:43:28,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:28,565 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-11-07 00:43:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:43:28,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-11-07 00:43:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:28,594 INFO L225 Difference]: With dead ends: 52 [2020-11-07 00:43:28,594 INFO L226 Difference]: Without dead ends: 34 [2020-11-07 00:43:28,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-07 00:43:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-07 00:43:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-07 00:43:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-11-07 00:43:28,697 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2020-11-07 00:43:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:28,699 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-11-07 00:43:28,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:43:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-11-07 00:43:28,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 00:43:28,706 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:28,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:28,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:43:28,708 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:28,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:28,718 INFO L82 PathProgramCache]: Analyzing trace with hash 653425116, now seen corresponding path program 1 times [2020-11-07 00:43:28,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:28,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1453766454] [2020-11-07 00:43:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:28,731 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-07 00:43:28,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1453766454] [2020-11-07 00:43:28,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:28,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:43:28,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212596663] [2020-11-07 00:43:28,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:43:28,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:43:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:43:28,931 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2020-11-07 00:43:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:29,240 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-11-07 00:43:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:43:29,241 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-11-07 00:43:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:29,243 INFO L225 Difference]: With dead ends: 46 [2020-11-07 00:43:29,243 INFO L226 Difference]: Without dead ends: 39 [2020-11-07 00:43:29,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-07 00:43:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-07 00:43:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-07 00:43:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2020-11-07 00:43:29,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2020-11-07 00:43:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:29,262 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2020-11-07 00:43:29,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:43:29,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2020-11-07 00:43:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 00:43:29,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:29,264 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:43:29,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:43:29,264 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:29,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:29,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1221623283, now seen corresponding path program 2 times [2020-11-07 00:43:29,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:29,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561121787] [2020-11-07 00:43:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:29,269 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 00:43:29,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561121787] [2020-11-07 00:43:29,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:29,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:43:29,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370921017] [2020-11-07 00:43:29,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:43:29,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:29,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:43:29,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:43:29,462 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 8 states. [2020-11-07 00:43:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:29,768 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-11-07 00:43:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:43:29,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-11-07 00:43:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:29,770 INFO L225 Difference]: With dead ends: 51 [2020-11-07 00:43:29,770 INFO L226 Difference]: Without dead ends: 44 [2020-11-07 00:43:29,771 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 00:43:29,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-11-07 00:43:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-11-07 00:43:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-11-07 00:43:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2020-11-07 00:43:29,786 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 45 [2020-11-07 00:43:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:29,786 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2020-11-07 00:43:29,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:43:29,787 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2020-11-07 00:43:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-07 00:43:29,788 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:29,789 INFO L422 BasicCegarLoop]: trace histogram [4, 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, 1] [2020-11-07 00:43:29,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:43:29,789 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:29,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash 942298982, now seen corresponding path program 3 times [2020-11-07 00:43:29,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:29,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1677110230] [2020-11-07 00:43:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:29,793 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:29,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-07 00:43:30,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1677110230] [2020-11-07 00:43:30,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:30,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:43:30,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310441420] [2020-11-07 00:43:30,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:43:30,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:30,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:43:30,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:43:30,008 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 9 states. [2020-11-07 00:43:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:30,380 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-11-07 00:43:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:43:30,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-11-07 00:43:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:30,383 INFO L225 Difference]: With dead ends: 56 [2020-11-07 00:43:30,383 INFO L226 Difference]: Without dead ends: 49 [2020-11-07 00:43:30,384 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 00:43:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-11-07 00:43:30,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-11-07 00:43:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-07 00:43:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2020-11-07 00:43:30,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 54 [2020-11-07 00:43:30,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:30,398 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2020-11-07 00:43:30,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:43:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2020-11-07 00:43:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-07 00:43:30,400 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:30,400 INFO L422 BasicCegarLoop]: trace histogram [5, 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, 1] [2020-11-07 00:43:30,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:43:30,401 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1161295337, now seen corresponding path program 4 times [2020-11-07 00:43:30,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:30,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [558930714] [2020-11-07 00:43:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:30,404 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-11-07 00:43:30,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [558930714] [2020-11-07 00:43:30,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:30,639 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:43:30,639 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177504677] [2020-11-07 00:43:30,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:43:30,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:30,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:43:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:43:30,641 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 10 states. [2020-11-07 00:43:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:31,186 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-11-07 00:43:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:43:31,187 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-11-07 00:43:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:31,188 INFO L225 Difference]: With dead ends: 61 [2020-11-07 00:43:31,188 INFO L226 Difference]: Without dead ends: 54 [2020-11-07 00:43:31,189 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 00:43:31,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-11-07 00:43:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-11-07 00:43:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-11-07 00:43:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-11-07 00:43:31,204 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 63 [2020-11-07 00:43:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:31,205 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-11-07 00:43:31,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:43:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-11-07 00:43:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-07 00:43:31,207 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:31,207 INFO L422 BasicCegarLoop]: trace histogram [6, 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, 1] [2020-11-07 00:43:31,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:43:31,207 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2109333008, now seen corresponding path program 5 times [2020-11-07 00:43:31,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:31,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265895282] [2020-11-07 00:43:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:31,211 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-11-07 00:43:31,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265895282] [2020-11-07 00:43:31,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:31,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:43:31,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394907785] [2020-11-07 00:43:31,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:43:31,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:31,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:43:31,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:43:31,452 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 11 states. [2020-11-07 00:43:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:32,023 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-11-07 00:43:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:43:32,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-11-07 00:43:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:32,026 INFO L225 Difference]: With dead ends: 66 [2020-11-07 00:43:32,026 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 00:43:32,027 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 00:43:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 00:43:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-11-07 00:43:32,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-11-07 00:43:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2020-11-07 00:43:32,043 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 72 [2020-11-07 00:43:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:32,044 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2020-11-07 00:43:32,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:43:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2020-11-07 00:43:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:43:32,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:32,046 INFO L422 BasicCegarLoop]: trace histogram [7, 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, 1] [2020-11-07 00:43:32,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:43:32,046 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:32,047 INFO L82 PathProgramCache]: Analyzing trace with hash 639783135, now seen corresponding path program 6 times [2020-11-07 00:43:32,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:32,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200426225] [2020-11-07 00:43:32,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:32,050 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-11-07 00:43:32,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200426225] [2020-11-07 00:43:32,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:32,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:43:32,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969440667] [2020-11-07 00:43:32,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:43:32,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:32,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:43:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:43:32,318 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 12 states. [2020-11-07 00:43:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:32,942 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-11-07 00:43:32,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:43:32,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-11-07 00:43:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:32,944 INFO L225 Difference]: With dead ends: 71 [2020-11-07 00:43:32,944 INFO L226 Difference]: Without dead ends: 64 [2020-11-07 00:43:32,945 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 00:43:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-11-07 00:43:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-11-07 00:43:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 00:43:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2020-11-07 00:43:32,964 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 81 [2020-11-07 00:43:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:32,964 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2020-11-07 00:43:32,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:43:32,964 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2020-11-07 00:43:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-11-07 00:43:32,966 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:32,966 INFO L422 BasicCegarLoop]: trace histogram [8, 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, 1] [2020-11-07 00:43:32,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:43:32,967 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1631598970, now seen corresponding path program 7 times [2020-11-07 00:43:32,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:32,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [470423880] [2020-11-07 00:43:32,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:32,973 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-11-07 00:43:33,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [470423880] [2020-11-07 00:43:33,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:33,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:43:33,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189975426] [2020-11-07 00:43:33,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:43:33,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:33,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:43:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:43:33,387 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 13 states. [2020-11-07 00:43:34,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:34,072 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-11-07 00:43:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:43:34,072 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-11-07 00:43:34,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:34,075 INFO L225 Difference]: With dead ends: 76 [2020-11-07 00:43:34,075 INFO L226 Difference]: Without dead ends: 69 [2020-11-07 00:43:34,076 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 00:43:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-07 00:43:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-07 00:43:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-07 00:43:34,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2020-11-07 00:43:34,094 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 90 [2020-11-07 00:43:34,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:34,094 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2020-11-07 00:43:34,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:43:34,094 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2020-11-07 00:43:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-07 00:43:34,096 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:34,096 INFO L422 BasicCegarLoop]: trace histogram [9, 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, 1] [2020-11-07 00:43:34,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:43:34,096 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:34,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:34,097 INFO L82 PathProgramCache]: Analyzing trace with hash -440062251, now seen corresponding path program 8 times [2020-11-07 00:43:34,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:34,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [971346888] [2020-11-07 00:43:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:34,100 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-11-07 00:43:34,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [971346888] [2020-11-07 00:43:34,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:34,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:43:34,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976652322] [2020-11-07 00:43:34,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:43:34,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:43:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:43:34,532 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 14 states. [2020-11-07 00:43:35,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:35,226 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-11-07 00:43:35,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:43:35,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-11-07 00:43:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:35,228 INFO L225 Difference]: With dead ends: 81 [2020-11-07 00:43:35,228 INFO L226 Difference]: Without dead ends: 74 [2020-11-07 00:43:35,229 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 00:43:35,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-11-07 00:43:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-11-07 00:43:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 00:43:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-11-07 00:43:35,278 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 99 [2020-11-07 00:43:35,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:35,280 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-11-07 00:43:35,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:43:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-11-07 00:43:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-11-07 00:43:35,287 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:35,287 INFO L422 BasicCegarLoop]: trace histogram [10, 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, 1] [2020-11-07 00:43:35,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:43:35,287 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:35,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:35,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1832058372, now seen corresponding path program 9 times [2020-11-07 00:43:35,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:35,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [796872549] [2020-11-07 00:43:35,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:35,297 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-11-07 00:43:35,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [796872549] [2020-11-07 00:43:35,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:35,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:43:35,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670518043] [2020-11-07 00:43:35,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:43:35,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:35,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:43:35,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:43:35,759 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 15 states. [2020-11-07 00:43:36,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:36,519 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-11-07 00:43:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:43:36,519 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-11-07 00:43:36,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:36,521 INFO L225 Difference]: With dead ends: 86 [2020-11-07 00:43:36,521 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 00:43:36,522 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 00:43:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 00:43:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-07 00:43:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-07 00:43:36,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-11-07 00:43:36,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 108 [2020-11-07 00:43:36,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:36,559 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-11-07 00:43:36,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:43:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-11-07 00:43:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-11-07 00:43:36,561 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:36,561 INFO L422 BasicCegarLoop]: trace histogram [11, 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, 1] [2020-11-07 00:43:36,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:43:36,562 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1858719797, now seen corresponding path program 10 times [2020-11-07 00:43:36,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:36,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1279649000] [2020-11-07 00:43:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:36,566 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:36,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-11-07 00:43:37,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1279649000] [2020-11-07 00:43:37,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:37,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-11-07 00:43:37,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288935331] [2020-11-07 00:43:37,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 00:43:37,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 00:43:37,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-07 00:43:37,121 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 16 states. [2020-11-07 00:43:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:37,921 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-11-07 00:43:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 00:43:37,922 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-11-07 00:43:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:37,923 INFO L225 Difference]: With dead ends: 91 [2020-11-07 00:43:37,923 INFO L226 Difference]: Without dead ends: 84 [2020-11-07 00:43:37,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-11-07 00:43:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-07 00:43:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-07 00:43:37,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-07 00:43:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2020-11-07 00:43:37,941 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 117 [2020-11-07 00:43:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:37,942 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2020-11-07 00:43:37,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 00:43:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2020-11-07 00:43:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-07 00:43:37,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:37,944 INFO L422 BasicCegarLoop]: trace histogram [12, 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, 1] [2020-11-07 00:43:37,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:43:37,944 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1671901298, now seen corresponding path program 11 times [2020-11-07 00:43:37,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:37,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1896981196] [2020-11-07 00:43:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:37,947 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-11-07 00:43:38,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1896981196] [2020-11-07 00:43:38,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:38,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:43:38,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389278295] [2020-11-07 00:43:38,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:43:38,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:38,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:43:38,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:43:38,552 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 17 states. [2020-11-07 00:43:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:39,428 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-11-07 00:43:39,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:43:39,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-11-07 00:43:39,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:39,430 INFO L225 Difference]: With dead ends: 96 [2020-11-07 00:43:39,430 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 00:43:39,431 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 00:43:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 00:43:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-07 00:43:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-07 00:43:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2020-11-07 00:43:39,446 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 126 [2020-11-07 00:43:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:39,446 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2020-11-07 00:43:39,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:43:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2020-11-07 00:43:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-11-07 00:43:39,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:39,448 INFO L422 BasicCegarLoop]: trace histogram [13, 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, 1] [2020-11-07 00:43:39,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:43:39,449 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:39,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1502940223, now seen corresponding path program 12 times [2020-11-07 00:43:39,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:39,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [303924298] [2020-11-07 00:43:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:39,451 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:39,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-11-07 00:43:40,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [303924298] [2020-11-07 00:43:40,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:40,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-11-07 00:43:40,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713193662] [2020-11-07 00:43:40,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-11-07 00:43:40,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-11-07 00:43:40,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-11-07 00:43:40,112 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 18 states. [2020-11-07 00:43:41,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:41,032 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-11-07 00:43:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-07 00:43:41,033 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-11-07 00:43:41,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:41,035 INFO L225 Difference]: With dead ends: 101 [2020-11-07 00:43:41,035 INFO L226 Difference]: Without dead ends: 94 [2020-11-07 00:43:41,037 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 00:43:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-11-07 00:43:41,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-11-07 00:43:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 00:43:41,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-11-07 00:43:41,062 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 135 [2020-11-07 00:43:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:41,063 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-11-07 00:43:41,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-11-07 00:43:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-11-07 00:43:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-07 00:43:41,066 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:41,067 INFO L422 BasicCegarLoop]: trace histogram [14, 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, 1] [2020-11-07 00:43:41,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-07 00:43:41,067 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:41,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:41,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1695288856, now seen corresponding path program 13 times [2020-11-07 00:43:41,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:41,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583460371] [2020-11-07 00:43:41,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:41,079 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-11-07 00:43:41,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583460371] [2020-11-07 00:43:41,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:41,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-11-07 00:43:41,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250822941] [2020-11-07 00:43:41,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 00:43:41,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:41,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 00:43:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:43:41,901 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 19 states. [2020-11-07 00:43:42,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:42,870 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-11-07 00:43:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 00:43:42,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-11-07 00:43:42,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:42,872 INFO L225 Difference]: With dead ends: 106 [2020-11-07 00:43:42,872 INFO L226 Difference]: Without dead ends: 99 [2020-11-07 00:43:42,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-11-07 00:43:42,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-07 00:43:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2020-11-07 00:43:42,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-07 00:43:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2020-11-07 00:43:42,900 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144 [2020-11-07 00:43:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:42,901 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2020-11-07 00:43:42,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 00:43:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2020-11-07 00:43:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-11-07 00:43:42,907 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:42,908 INFO L422 BasicCegarLoop]: trace histogram [15, 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, 1] [2020-11-07 00:43:42,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-07 00:43:42,908 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:42,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1916345015, now seen corresponding path program 14 times [2020-11-07 00:43:42,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:42,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1024662611] [2020-11-07 00:43:42,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:42,912 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-11-07 00:43:43,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1024662611] [2020-11-07 00:43:43,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:43,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-11-07 00:43:43,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302842238] [2020-11-07 00:43:43,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-07 00:43:43,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-07 00:43:43,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-11-07 00:43:43,797 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 20 states. [2020-11-07 00:43:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:44,954 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-11-07 00:43:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 00:43:44,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-11-07 00:43:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:44,959 INFO L225 Difference]: With dead ends: 111 [2020-11-07 00:43:44,959 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 00:43:44,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 00:43:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 00:43:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-07 00:43:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-07 00:43:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2020-11-07 00:43:44,986 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 153 [2020-11-07 00:43:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:44,990 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2020-11-07 00:43:44,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-07 00:43:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2020-11-07 00:43:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-11-07 00:43:44,992 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:43:44,992 INFO L422 BasicCegarLoop]: trace histogram [16, 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, 1] [2020-11-07 00:43:44,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-07 00:43:44,993 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:43:44,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:43:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -540599902, now seen corresponding path program 15 times [2020-11-07 00:43:44,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:43:44,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845615699] [2020-11-07 00:43:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:43:45,003 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:43:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:43:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 00:43:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:45,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:46,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 00:43:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:43:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2020-11-07 00:43:47,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845615699] [2020-11-07 00:43:47,332 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:43:47,332 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2020-11-07 00:43:47,332 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312770609] [2020-11-07 00:43:47,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2020-11-07 00:43:47,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:43:47,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2020-11-07 00:43:47,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2020-11-07 00:43:47,334 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 42 states. [2020-11-07 00:43:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:43:54,923 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-11-07 00:43:54,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2020-11-07 00:43:54,923 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2020-11-07 00:43:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:43:54,924 INFO L225 Difference]: With dead ends: 104 [2020-11-07 00:43:54,924 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:43:54,928 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1317 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1810, Invalid=7502, Unknown=0, NotChecked=0, Total=9312 [2020-11-07 00:43:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:43:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:43:54,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:43:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:43:54,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2020-11-07 00:43:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:43:54,929 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:43:54,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2020-11-07 00:43:54,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:43:54,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:43:54,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-07 00:43:54,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:43:56,899 WARN L194 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 138 DAG size of output: 104 [2020-11-07 00:43:57,850 WARN L194 SmtUtils]: Spent 816.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2020-11-07 00:43:58,744 WARN L194 SmtUtils]: Spent 851.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 84 [2020-11-07 00:43:59,816 WARN L194 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2020-11-07 00:44:00,957 WARN L194 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2020-11-07 00:44:01,143 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,143 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,143 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,143 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,143 INFO L269 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,144 INFO L269 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-11-07 00:44:01,145 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,145 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,145 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,145 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,145 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:44:01,145 INFO L262 CegarLoopResult]: At program point sumEXIT(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 14)) (and .cse3 (<= (+ |sum_#in~m| 15) |sum_#res|))))) [2020-11-07 00:44:01,146 INFO L262 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= 1 sum_~n) (= sum_~m |sum_#in~m|)) [2020-11-07 00:44:01,146 INFO L262 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-11-07 00:44:01,146 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= sum_~n 0)) [2020-11-07 00:44:01,147 INFO L262 CegarLoopResult]: At program point L9-2(line 9) the Hoare annotation is: (let ((.cse0 (= sum_~n |sum_#in~n|)) (.cse1 (= sum_~m |sum_#in~m|)) (.cse2 (<= |sum_#t~ret7| (+ |sum_#in~n| |sum_#in~m|)))) (or (and .cse0 .cse1 (<= |sum_#in~n| 6) (<= (+ |sum_#in~m| 6) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 7) (<= (+ |sum_#in~m| 7) |sum_#t~ret7|) .cse2) (and .cse0 (<= (+ |sum_#in~m| 1) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 1) .cse2) (and .cse0 (<= |sum_#in~n| 2) .cse1 .cse2 (<= (+ |sum_#in~m| 2) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 3) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 3) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 8) (<= (+ |sum_#in~m| 8) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 11) .cse2 (<= (+ |sum_#in~m| 11) |sum_#t~ret7|)) (and .cse0 .cse1 (<= (+ |sum_#in~m| 10) |sum_#t~ret7|) .cse2 (<= |sum_#in~n| 10)) (and .cse0 .cse1 .cse2 (<= (+ |sum_#in~m| 15) |sum_#t~ret7|)) (and .cse0 (<= (+ |sum_#in~m| 4) |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse1 .cse2) (and .cse0 (<= |sum_#in~n| 5) .cse1 (<= (+ |sum_#in~m| 5) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#t~ret7|) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse2) (and .cse0 .cse1 (<= (+ |sum_#in~m| 13) |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse2) (and .cse0 (<= (+ |sum_#in~m| 14) |sum_#t~ret7|) .cse1 (<= |sum_#in~n| 14) .cse2))) [2020-11-07 00:44:01,147 INFO L262 CegarLoopResult]: At program point L6(lines 6 10) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-11-07 00:44:01,147 INFO L262 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (and (let ((.cse17 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse0 (= sum_~m |sum_#in~m|)) (.cse1 (<= |sum_#res| .cse17)) (.cse3 (<= |sum_#t~ret7| .cse17))) (or (let ((.cse2 (+ |sum_#in~m| 12))) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= .cse2 |sum_#t~ret7|) .cse3 (<= .cse2 |sum_#res|))) (let ((.cse4 (+ |sum_#in~m| 10))) (and (<= .cse4 |sum_#res|) .cse0 .cse1 (<= .cse4 |sum_#t~ret7|) .cse3 (<= |sum_#in~n| 10))) (let ((.cse5 (+ |sum_#in~m| 5))) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= .cse5 |sum_#t~ret7|) (<= .cse5 |sum_#res|) .cse3)) (let ((.cse6 (+ |sum_#in~m| 6))) (and (<= .cse6 |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6) (<= .cse6 |sum_#t~ret7|) .cse3)) (let ((.cse7 (+ |sum_#in~m| 14))) (and (<= .cse7 |sum_#t~ret7|) (<= .cse7 |sum_#res|) .cse0 .cse1 .cse3)) (let ((.cse8 (+ |sum_#in~m| 13))) (and .cse0 (<= .cse8 |sum_#t~ret7|) (<= |sum_#in~n| 13) .cse1 (<= .cse8 |sum_#res|) .cse3)) (let ((.cse9 (+ |sum_#in~m| 11))) (and (<= .cse9 |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11) .cse3 (<= .cse9 |sum_#t~ret7|))) (let ((.cse10 (+ |sum_#in~m| 3))) (and (<= .cse10 |sum_#t~ret7|) .cse0 (<= |sum_#in~n| 3) .cse1 (<= .cse10 |sum_#res|) .cse3)) (let ((.cse11 (+ |sum_#in~m| 9))) (and .cse0 .cse1 (<= .cse11 |sum_#res|) (<= .cse11 |sum_#t~ret7|) (<= |sum_#in~n| 9) .cse3)) (let ((.cse12 (+ |sum_#in~m| 8))) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= .cse12 |sum_#res|) (<= .cse12 |sum_#t~ret7|) .cse3)) (let ((.cse13 (+ |sum_#in~m| 7))) (and .cse0 (<= .cse13 |sum_#res|) (<= |sum_#in~n| 7) .cse1 (<= .cse13 |sum_#t~ret7|) .cse3)) (let ((.cse14 (+ |sum_#in~m| 4))) (and (<= .cse14 |sum_#t~ret7|) (<= |sum_#in~n| 4) .cse0 .cse1 (<= .cse14 |sum_#res|) .cse3)) (let ((.cse15 (+ |sum_#in~m| 1))) (and (<= .cse15 |sum_#t~ret7|) (<= .cse15 |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1 .cse3)) (let ((.cse16 (+ |sum_#in~m| 2))) (and (<= .cse16 |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1 .cse3 (<= .cse16 |sum_#t~ret7|)))))) (let ((.cse18 (= sum_~n |sum_#in~n|))) (or (and .cse18 (<= |sum_#in~n| 14)) (let ((.cse19 (+ |sum_#in~m| 15))) (and .cse18 (<= .cse19 |sum_#res|) (<= .cse19 |sum_#t~ret7|)))))) [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point L5(lines 5 11) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point sumFINAL(lines 5 11) the Hoare annotation is: (and (let ((.cse2 (+ |sum_#in~n| |sum_#in~m|))) (let ((.cse1 (<= |sum_#res| .cse2)) (.cse0 (= sum_~m |sum_#in~m|))) (or (and .cse0 (<= (+ |sum_#in~m| 7) |sum_#res|) (<= |sum_#in~n| 7) .cse1) (and (<= (+ |sum_#in~m| 2) |sum_#res|) (<= |sum_#in~n| 2) .cse0 .cse1) (and .cse0 .cse1 (<= (+ |sum_#in~m| 9) |sum_#res|) (<= |sum_#in~n| 9)) (and (<= (+ |sum_#in~m| 6) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 6)) (and (<= |sum_#in~n| 5) .cse0 .cse1 (<= (+ |sum_#in~m| 5) |sum_#res|)) (and (<= (+ |sum_#in~m| 1) |sum_#res|) .cse0 (<= |sum_#in~n| 1) .cse1) (and .cse0 (<= |sum_#in~n| 8) .cse1 (<= (+ |sum_#in~m| 8) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 3) .cse1 (<= (+ |sum_#in~m| 3) |sum_#res|)) (and (<= |sum_#in~n| 4) .cse0 .cse1 (<= (+ |sum_#in~m| 4) |sum_#res|)) (and .cse0 (<= |sum_#in~n| 13) .cse1 (<= (+ |sum_#in~m| 13) |sum_#res|)) (and (<= (+ |sum_#in~m| 10) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 10)) (and (<= (+ |sum_#in~m| 14) |sum_#res|) .cse0 .cse1) (and (<= (+ |sum_#in~m| 11) |sum_#res|) .cse0 .cse1 (<= |sum_#in~n| 11)) (and .cse0 .cse1 (<= |sum_#in~n| 12) (<= (+ |sum_#in~m| 12) |sum_#res|)) (and (<= |sum_#res| |sum_#in~m|) .cse0 (<= .cse2 |sum_#res|))))) (let ((.cse3 (= sum_~n |sum_#in~n|))) (or (and .cse3 (<= |sum_#in~n| 14)) (and .cse3 (<= (+ |sum_#in~m| 15) |sum_#res|))))) [2020-11-07 00:44:01,148 INFO L269 CegarLoopResult]: At program point sumENTRY(lines 5 11) the Hoare annotation is: true [2020-11-07 00:44:01,148 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 13 20) the Hoare annotation is: true [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 13 20) the Hoare annotation is: (<= 15 main_~a~0) [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: false [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point L17(lines 17 19) the Hoare annotation is: (and (<= main_~a~0 main_~result~0) (<= 15 main_~a~0) (<= main_~result~0 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: false [2020-11-07 00:44:01,148 INFO L262 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= 15 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 00:44:01,149 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= 15 main_~a~0) (<= main_~a~0 15)) [2020-11-07 00:44:01,149 INFO L262 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 00:44:01,149 INFO L262 CegarLoopResult]: At program point L17-2(lines 13 20) the Hoare annotation is: (<= 15 main_~a~0) [2020-11-07 00:44:01,149 INFO L262 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 00:44:01,149 INFO L262 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (and (<= |main_#t~ret8| main_~a~0) (<= main_~a~0 main_~result~0) (<= 15 main_~a~0) (<= main_~a~0 |main_#t~ret8|) (<= main_~result~0 main_~a~0) (= main_~b~0 0) (<= main_~a~0 15)) [2020-11-07 00:44:01,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:44:01 BoogieIcfgContainer [2020-11-07 00:44:01,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:44:01,188 INFO L168 Benchmark]: Toolchain (without parser) took 34574.92 ms. Allocated memory was 160.4 MB in the beginning and 402.7 MB in the end (delta: 242.2 MB). Free memory was 137.1 MB in the beginning and 220.0 MB in the end (delta: -82.9 MB). Peak memory consumption was 236.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:01,189 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 125.8 MB. Free memory was 104.6 MB in the beginning and 104.5 MB in the end (delta: 68.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:44:01,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 261.19 ms. Allocated memory is still 160.4 MB. Free memory was 136.4 MB in the beginning and 127.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:01,190 INFO L168 Benchmark]: Boogie Preprocessor took 30.55 ms. Allocated memory is still 160.4 MB. Free memory was 127.4 MB in the beginning and 126.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:01,190 INFO L168 Benchmark]: RCFGBuilder took 363.64 ms. Allocated memory is still 160.4 MB. Free memory was 126.1 MB in the beginning and 112.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:01,191 INFO L168 Benchmark]: TraceAbstraction took 33906.74 ms. Allocated memory was 160.4 MB in the beginning and 402.7 MB in the end (delta: 242.2 MB). Free memory was 112.3 MB in the beginning and 220.0 MB in the end (delta: -107.7 MB). Peak memory consumption was 211.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:44:01,196 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 104.6 MB in the beginning and 104.5 MB in the end (delta: 68.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 261.19 ms. Allocated memory is still 160.4 MB. Free memory was 136.4 MB in the beginning and 127.4 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 30.55 ms. Allocated memory is still 160.4 MB. Free memory was 127.4 MB in the beginning and 126.2 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 363.64 ms. Allocated memory is still 160.4 MB. Free memory was 126.1 MB in the beginning and 112.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 33906.74 ms. Allocated memory was 160.4 MB in the beginning and 402.7 MB in the end (delta: 242.2 MB). Free memory was 112.3 MB in the beginning and 220.0 MB in the end (delta: -107.7 MB). Peak memory consumption was 211.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum: (((((((((((((((((m == \old(m) && \old(m) + 7 <= \result) && \old(n) <= 7) && \result <= \old(n) + \old(m)) || (((\old(m) + 2 <= \result && \old(n) <= 2) && m == \old(m)) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(m) + 9 <= \result) && \old(n) <= 9)) || (((\old(m) + 6 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 6)) || (((\old(n) <= 5 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 5 <= \result)) || (((\old(m) + 1 <= \result && m == \old(m)) && \old(n) <= 1) && \result <= \old(n) + \old(m))) || (((m == \old(m) && \old(n) <= 8) && \result <= \old(n) + \old(m)) && \old(m) + 8 <= \result)) || (((m == \old(m) && \old(n) <= 3) && \result <= \old(n) + \old(m)) && \old(m) + 3 <= \result)) || (((\old(n) <= 4 && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(m) + 4 <= \result)) || (((m == \old(m) && \old(n) <= 13) && \result <= \old(n) + \old(m)) && \old(m) + 13 <= \result)) || (((\old(m) + 10 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 10)) || ((\old(m) + 14 <= \result && m == \old(m)) && \result <= \old(n) + \old(m))) || (((\old(m) + 11 <= \result && m == \old(m)) && \result <= \old(n) + \old(m)) && \old(n) <= 11)) || (((m == \old(m) && \result <= \old(n) + \old(m)) && \old(n) <= 12) && \old(m) + 12 <= \result)) || ((\result <= \old(m) && m == \old(m)) && \old(n) + \old(m) <= \result)) && ((n == \old(n) && \old(n) <= 14) || (n == \old(n) && \old(m) + 15 <= \result)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 15 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.5s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 458 SDtfs, 1346 SDslu, 1037 SDs, 0 SdLazy, 2444 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2677 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=15, 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, 16 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 109 PreInvPairs, 334 NumberOfFragments, 1702 HoareAnnotationTreeSize, 109 FomulaSimplifications, 4473 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 39 FomulaSimplificationsInter, 6506 FormulaSimplificationTreeSizeReductionInter, 5.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...