/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/id_i10_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 00:41:53,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 00:41:53,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 00:41:53,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 00:41:53,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 00:41:53,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 00:41:53,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 00:41:53,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 00:41:53,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 00:41:53,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 00:41:53,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 00:41:53,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 00:41:53,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 00:41:53,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 00:41:53,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 00:41:53,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 00:41:53,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 00:41:53,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 00:41:53,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 00:41:53,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 00:41:53,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 00:41:53,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 00:41:53,297 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 00:41:53,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 00:41:53,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 00:41:53,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 00:41:53,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 00:41:53,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 00:41:53,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 00:41:53,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 00:41:53,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 00:41:53,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 00:41:53,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 00:41:53,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 00:41:53,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 00:41:53,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 00:41:53,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 00:41:53,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 00:41:53,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 00:41:53,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 00:41:53,323 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 00:41:53,324 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:41:53,352 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 00:41:53,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 00:41:53,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 00:41:53,355 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 00:41:53,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 00:41:53,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 00:41:53,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 00:41:53,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 00:41:53,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 00:41:53,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 00:41:53,356 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 00:41:53,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 00:41:53,357 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 00:41:53,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 00:41:53,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 00:41:53,358 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 00:41:53,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 00:41:53,358 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 00:41:53,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 00:41:53,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 00:41:53,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 00:41:53,359 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 00:41:53,359 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:41:53,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 00:41:53,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 00:41:53,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 00:41:53,823 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 00:41:53,824 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 00:41:53,825 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-11-07 00:41:53,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032f8c49d/bb1665afd56f443d80a625f66816b68d/FLAG539c2bbec [2020-11-07 00:41:54,528 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 00:41:54,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i10_o10-2.c [2020-11-07 00:41:54,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032f8c49d/bb1665afd56f443d80a625f66816b68d/FLAG539c2bbec [2020-11-07 00:41:54,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/032f8c49d/bb1665afd56f443d80a625f66816b68d [2020-11-07 00:41:54,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 00:41:54,916 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 00:41:54,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:54,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 00:41:54,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 00:41:54,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:54" (1/1) ... [2020-11-07 00:41:54,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0cd9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:54, skipping insertion in model container [2020-11-07 00:41:54,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:54" (1/1) ... [2020-11-07 00:41:54,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 00:41:54,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 00:41:55,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:55,226 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 00:41:55,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 00:41:55,264 INFO L208 MainTranslator]: Completed translation [2020-11-07 00:41:55,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55 WrapperNode [2020-11-07 00:41:55,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 00:41:55,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 00:41:55,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 00:41:55,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 00:41:55,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (1/1) ... [2020-11-07 00:41:55,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 00:41:55,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 00:41:55,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 00:41:55,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 00:41:55,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (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:41:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 00:41:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 00:41:55,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 00:41:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 00:41:55,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 00:41:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 00:41:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 00:41:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 00:41:55,391 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 00:41:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 00:41:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 00:41:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 00:41:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 00:41:55,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 00:41:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 00:41:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 00:41:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 00:41:55,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 00:41:55,609 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 00:41:55,609 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 00:41:55,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:55 BoogieIcfgContainer [2020-11-07 00:41:55,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 00:41:55,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 00:41:55,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 00:41:55,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 00:41:55,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:54" (1/3) ... [2020-11-07 00:41:55,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6568ee69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:55, skipping insertion in model container [2020-11-07 00:41:55,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55" (2/3) ... [2020-11-07 00:41:55,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6568ee69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:55, skipping insertion in model container [2020-11-07 00:41:55,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:55" (3/3) ... [2020-11-07 00:41:55,623 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2020-11-07 00:41:55,671 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 00:41:55,678 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 00:41:55,719 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 00:41:55,782 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 00:41:55,782 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 00:41:55,783 INFO L379 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-11-07 00:41:55,783 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 00:41:55,783 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 00:41:55,783 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 00:41:55,783 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 00:41:55,783 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 00:41:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-11-07 00:41:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 00:41:55,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:55,843 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:55,844 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:55,866 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-11-07 00:41:55,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:55,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [704316610] [2020-11-07 00:41:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:55,990 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,414 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:41:56,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [704316610] [2020-11-07 00:41:56,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:56,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 00:41:56,419 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898619112] [2020-11-07 00:41:56,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 00:41:56,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 00:41:56,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 00:41:56,444 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-11-07 00:41:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:56,753 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-11-07 00:41:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 00:41:56,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 00:41:56,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:56,766 INFO L225 Difference]: With dead ends: 50 [2020-11-07 00:41:56,766 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 00:41:56,770 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:41:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 00:41:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-07 00:41:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-07 00:41:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-11-07 00:41:56,824 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-11-07 00:41:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:56,825 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-11-07 00:41:56,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 00:41:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-11-07 00:41:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-07 00:41:56,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:56,828 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:56,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 00:41:56,829 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-11-07 00:41:56,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:56,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1405758584] [2020-11-07 00:41:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:56,834 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 00:41:56,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1405758584] [2020-11-07 00:41:56,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:56,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 00:41:56,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991116390] [2020-11-07 00:41:56,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 00:41:56,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 00:41:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-07 00:41:56,986 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-11-07 00:41:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:57,276 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-11-07 00:41:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 00:41:57,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-11-07 00:41:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:57,281 INFO L225 Difference]: With dead ends: 44 [2020-11-07 00:41:57,281 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 00:41:57,283 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:41:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 00:41:57,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-11-07 00:41:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-07 00:41:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-11-07 00:41:57,296 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-11-07 00:41:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:57,297 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-11-07 00:41:57,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 00:41:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-11-07 00:41:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-07 00:41:57,299 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:57,299 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:57,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 00:41:57,300 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:57,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-11-07 00:41:57,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:57,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [289123117] [2020-11-07 00:41:57,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:57,304 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 00:41:57,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [289123117] [2020-11-07 00:41:57,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:57,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 00:41:57,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365542810] [2020-11-07 00:41:57,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 00:41:57,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:57,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 00:41:57,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-07 00:41:57,469 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-11-07 00:41:57,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:57,753 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-11-07 00:41:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 00:41:57,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-11-07 00:41:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:57,756 INFO L225 Difference]: With dead ends: 49 [2020-11-07 00:41:57,756 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 00:41:57,757 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:41:57,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 00:41:57,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-07 00:41:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-07 00:41:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-11-07 00:41:57,773 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-11-07 00:41:57,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:57,773 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-11-07 00:41:57,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 00:41:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-11-07 00:41:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 00:41:57,776 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:57,776 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:57,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 00:41:57,777 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-11-07 00:41:57,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:57,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1492274427] [2020-11-07 00:41:57,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:57,781 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:57,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-11-07 00:41:58,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1492274427] [2020-11-07 00:41:58,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:58,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 00:41:58,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141840620] [2020-11-07 00:41:58,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 00:41:58,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 00:41:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-07 00:41:58,016 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-11-07 00:41:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:58,391 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-11-07 00:41:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 00:41:58,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-11-07 00:41:58,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:58,393 INFO L225 Difference]: With dead ends: 54 [2020-11-07 00:41:58,393 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 00:41:58,394 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:41:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 00:41:58,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-11-07 00:41:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-11-07 00:41:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-11-07 00:41:58,408 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-11-07 00:41:58,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:58,409 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-11-07 00:41:58,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 00:41:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-11-07 00:41:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 00:41:58,411 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:58,411 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:58,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 00:41:58,411 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-11-07 00:41:58,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:58,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1526461501] [2020-11-07 00:41:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:58,415 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-11-07 00:41:58,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1526461501] [2020-11-07 00:41:58,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:58,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-07 00:41:58,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123135835] [2020-11-07 00:41:58,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 00:41:58,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 00:41:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-07 00:41:58,640 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-11-07 00:41:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:59,127 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-11-07 00:41:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 00:41:59,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-11-07 00:41:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:59,131 INFO L225 Difference]: With dead ends: 59 [2020-11-07 00:41:59,131 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 00:41:59,132 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:41:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 00:41:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-11-07 00:41:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-11-07 00:41:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-11-07 00:41:59,158 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-11-07 00:41:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:59,158 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-11-07 00:41:59,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 00:41:59,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-11-07 00:41:59,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 00:41:59,160 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:41:59,160 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:41:59,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 00:41:59,161 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:41:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:41:59,161 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-11-07 00:41:59,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:41:59,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491796025] [2020-11-07 00:41:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:41:59,164 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:41:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:41:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:41:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:41:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:41:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-11-07 00:41:59,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491796025] [2020-11-07 00:41:59,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:41:59,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 00:41:59,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358894947] [2020-11-07 00:41:59,435 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 00:41:59,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:41:59,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 00:41:59,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-11-07 00:41:59,436 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-11-07 00:41:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:41:59,978 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-11-07 00:41:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 00:41:59,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-11-07 00:41:59,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:41:59,980 INFO L225 Difference]: With dead ends: 64 [2020-11-07 00:41:59,980 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 00:41:59,984 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-11-07 00:41:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 00:41:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 00:41:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 00:41:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-11-07 00:41:59,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-11-07 00:41:59,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:41:59,999 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-11-07 00:41:59,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 00:41:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-11-07 00:42:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-07 00:42:00,001 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:00,001 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:00,001 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 00:42:00,001 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-11-07 00:42:00,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:00,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [637575954] [2020-11-07 00:42:00,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:00,005 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,267 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-11-07 00:42:00,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [637575954] [2020-11-07 00:42:00,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:00,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-07 00:42:00,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572327395] [2020-11-07 00:42:00,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 00:42:00,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 00:42:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-11-07 00:42:00,271 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-11-07 00:42:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:00,813 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-11-07 00:42:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 00:42:00,814 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-11-07 00:42:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:00,815 INFO L225 Difference]: With dead ends: 69 [2020-11-07 00:42:00,816 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 00:42:00,817 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:42:00,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 00:42:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-07 00:42:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 00:42:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-11-07 00:42:00,834 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-11-07 00:42:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:00,834 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-11-07 00:42:00,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 00:42:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-11-07 00:42:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-07 00:42:00,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:00,836 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:00,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 00:42:00,837 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:00,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-11-07 00:42:00,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:00,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311706908] [2020-11-07 00:42:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:00,840 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:00,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-11-07 00:42:01,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311706908] [2020-11-07 00:42:01,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:01,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-07 00:42:01,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489963796] [2020-11-07 00:42:01,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 00:42:01,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:01,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 00:42:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-11-07 00:42:01,157 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-11-07 00:42:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:01,755 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-11-07 00:42:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 00:42:01,756 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-11-07 00:42:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:01,758 INFO L225 Difference]: With dead ends: 74 [2020-11-07 00:42:01,758 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 00:42:01,760 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-11-07 00:42:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 00:42:01,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-11-07 00:42:01,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-11-07 00:42:01,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-11-07 00:42:01,795 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-11-07 00:42:01,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:01,796 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-11-07 00:42:01,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 00:42:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-11-07 00:42:01,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-07 00:42:01,800 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:01,800 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:01,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 00:42:01,805 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:01,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-11-07 00:42:01,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:01,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544047935] [2020-11-07 00:42:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:01,809 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:01,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,137 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-11-07 00:42:02,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544047935] [2020-11-07 00:42:02,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:02,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 00:42:02,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923563753] [2020-11-07 00:42:02,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 00:42:02,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 00:42:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-11-07 00:42:02,239 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-11-07 00:42:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:02,871 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-11-07 00:42:02,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-07 00:42:02,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-11-07 00:42:02,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:02,873 INFO L225 Difference]: With dead ends: 79 [2020-11-07 00:42:02,873 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 00:42:02,878 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:42:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 00:42:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-11-07 00:42:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-11-07 00:42:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-11-07 00:42:02,900 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-11-07 00:42:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:02,900 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-11-07 00:42:02,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 00:42:02,901 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-11-07 00:42:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-11-07 00:42:02,902 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:02,902 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:02,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 00:42:02,903 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:02,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:02,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-11-07 00:42:02,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:02,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923365182] [2020-11-07 00:42:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:02,906 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:02,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-11-07 00:42:03,335 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923365182] [2020-11-07 00:42:03,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:03,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-07 00:42:03,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210586063] [2020-11-07 00:42:03,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 00:42:03,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:03,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 00:42:03,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-11-07 00:42:03,338 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-11-07 00:42:04,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:04,057 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-11-07 00:42:04,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 00:42:04,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-11-07 00:42:04,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:04,059 INFO L225 Difference]: With dead ends: 84 [2020-11-07 00:42:04,060 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 00:42:04,061 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:42:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 00:42:04,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-11-07 00:42:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-11-07 00:42:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-11-07 00:42:04,077 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-11-07 00:42:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:04,078 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-11-07 00:42:04,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 00:42:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-11-07 00:42:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-11-07 00:42:04,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:04,080 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:04,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 00:42:04,080 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:04,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-11-07 00:42:04,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:04,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1519937695] [2020-11-07 00:42:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:04,084 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:04,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-11-07 00:42:05,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1519937695] [2020-11-07 00:42:05,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:05,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-11-07 00:42:05,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807802042] [2020-11-07 00:42:05,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-11-07 00:42:05,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:05,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-11-07 00:42:05,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2020-11-07 00:42:05,014 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 26 states. [2020-11-07 00:42:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:08,131 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-11-07 00:42:08,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 00:42:08,132 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2020-11-07 00:42:08,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:08,134 INFO L225 Difference]: With dead ends: 89 [2020-11-07 00:42:08,134 INFO L226 Difference]: Without dead ends: 82 [2020-11-07 00:42:08,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=218, Invalid=3322, Unknown=0, NotChecked=0, Total=3540 [2020-11-07 00:42:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-11-07 00:42:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-11-07 00:42:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-11-07 00:42:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-11-07 00:42:08,172 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-11-07 00:42:08,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:08,173 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-11-07 00:42:08,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-11-07 00:42:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-11-07 00:42:08,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-07 00:42:08,178 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 00:42:08,178 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 00:42:08,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 00:42:08,178 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 00:42:08,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 00:42:08,179 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-11-07 00:42:08,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 00:42:08,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [435749277] [2020-11-07 00:42:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 00:42:08,185 INFO L328 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-11-07 00:42:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 00:42:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-11-07 00:42:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 00:42:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 00:42:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-11-07 00:42:08,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [435749277] [2020-11-07 00:42:08,816 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 00:42:08,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-11-07 00:42:08,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794705163] [2020-11-07 00:42:08,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 00:42:08,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 00:42:08,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 00:42:08,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2020-11-07 00:42:08,818 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-11-07 00:42:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 00:42:09,802 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2020-11-07 00:42:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 00:42:09,803 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-11-07 00:42:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 00:42:09,804 INFO L225 Difference]: With dead ends: 82 [2020-11-07 00:42:09,804 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 00:42:09,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=654, Unknown=0, NotChecked=0, Total=930 [2020-11-07 00:42:09,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 00:42:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 00:42:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 00:42:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 00:42:09,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2020-11-07 00:42:09,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 00:42:09,807 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 00:42:09,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 00:42:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 00:42:09,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 00:42:09,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 00:42:09,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 00:42:11,087 WARN L194 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 00:42:11,687 WARN L194 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 71 [2020-11-07 00:42:12,294 WARN L194 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-11-07 00:42:12,772 WARN L194 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2020-11-07 00:42:13,387 WARN L194 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2020-11-07 00:42:13,393 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,394 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,394 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,395 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,395 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,395 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,395 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,395 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,395 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,396 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:42:13,396 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,396 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 00:42:13,397 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-11-07 00:42:13,397 INFO L262 CegarLoopResult]: At program point mainEXIT(lines 11 17) the Hoare annotation is: (<= 10 main_~input~0) [2020-11-07 00:42:13,397 INFO L262 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: false [2020-11-07 00:42:13,397 INFO L262 CegarLoopResult]: At program point L14(lines 14 16) the Hoare annotation is: (and (<= main_~result~0 10) (<= 10 main_~input~0) (<= 10 main_~result~0)) [2020-11-07 00:42:13,397 INFO L262 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: false [2020-11-07 00:42:13,398 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= 10 main_~input~0) (<= main_~input~0 10)) [2020-11-07 00:42:13,398 INFO L262 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 10) (<= 10 |main_#t~ret8|) (<= 10 main_~input~0)) [2020-11-07 00:42:13,398 INFO L262 CegarLoopResult]: At program point L14-2(lines 11 17) the Hoare annotation is: (<= 10 main_~input~0) [2020-11-07 00:42:13,398 INFO L262 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 10) (<= 10 |main_#t~ret8|) (<= 10 main_~input~0)) [2020-11-07 00:42:13,398 INFO L262 CegarLoopResult]: At program point L13-3(line 13) the Hoare annotation is: (and (<= |main_#t~ret8| 10) (<= main_~result~0 10) (<= 10 |main_#t~ret8|) (<= 10 main_~input~0) (<= 10 main_~result~0)) [2020-11-07 00:42:13,399 INFO L262 CegarLoopResult]: At program point idFINAL(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and .cse0 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 00:42:13,399 INFO L262 CegarLoopResult]: At program point idEXIT(lines 6 9) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 4 |id_#in~x|)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5)) (and .cse0 (<= 10 |id_#in~x|) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= 2 |id_#res|) .cse0 (<= |id_#res| 2) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= |id_#res| 6) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and .cse0 (= |id_#res| 0) (= |id_#in~x| 0)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= 8 |id_#res|) (<= |id_#in~x| 8)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 9 |id_#in~x|)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 00:42:13,399 INFO L262 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 00:42:13,399 INFO L269 CegarLoopResult]: At program point idENTRY(lines 6 9) the Hoare annotation is: true [2020-11-07 00:42:13,399 INFO L262 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-11-07 00:42:13,400 INFO L262 CegarLoopResult]: At program point L8-1(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and .cse0 (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 00:42:13,400 INFO L262 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-11-07 00:42:13,400 INFO L262 CegarLoopResult]: At program point L8-2(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) .cse0 (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and .cse0 (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9)) (and (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and .cse0 (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and .cse0 (<= |id_#in~x| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3)) (and (<= 5 |id_#t~ret7|) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= |id_#in~x| 6)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 00:42:13,401 INFO L262 CegarLoopResult]: At program point L8-3(line 8) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= |id_#res| 3) (<= 3 |id_#in~x|) .cse0 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= |id_#in~x| 3) (<= 3 |id_#res|)) (and (<= 1 |id_#in~x|) .cse0 (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (and .cse0 (<= 9 |id_#t~ret7|) (<= 10 |id_#in~x|) (<= |id_#t~ret7| 9) (<= 10 |id_#res|) (<= |id_#res| 10)) (and (<= |id_#res| 8) .cse0 (<= 8 |id_#in~x|) (<= |id_#t~ret7| 7) (<= 8 |id_#res|) (<= 7 |id_#t~ret7|) (<= |id_#in~x| 8)) (and (<= |id_#t~ret7| 6) (<= 7 |id_#res|) .cse0 (<= |id_#res| 7) (<= 6 |id_#t~ret7|) (<= 7 |id_#in~x|) (<= |id_#in~x| 7)) (and (<= |id_#res| 4) (<= 4 |id_#res|) .cse0 (<= |id_#in~x| 4) (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3) (<= 4 |id_#in~x|)) (and (<= 9 |id_#res|) .cse0 (<= |id_#in~x| 9) (<= |id_#res| 9) (<= 8 |id_#t~ret7|) (<= |id_#t~ret7| 8) (<= 9 |id_#in~x|)) (and (<= 2 |id_#res|) .cse0 (<= |id_#t~ret7| 1) (<= |id_#res| 2) (<= 1 |id_#t~ret7|) (<= 2 |id_#in~x|) (<= |id_#in~x| 2)) (and (<= 5 |id_#res|) (<= 5 |id_#in~x|) (<= |id_#in~x| 5) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and (<= 5 |id_#t~ret7|) (<= |id_#res| 6) (<= |id_#t~ret7| 5) .cse0 (<= 6 |id_#in~x|) (<= 6 |id_#res|) (<= |id_#in~x| 6)) (and (<= 11 |id_#in~x|) .cse0))) [2020-11-07 00:42:13,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:42:13 BoogieIcfgContainer [2020-11-07 00:42:13,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 00:42:13,451 INFO L168 Benchmark]: Toolchain (without parser) took 18533.32 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 128.1 MB in the beginning and 261.7 MB in the end (delta: -133.6 MB). Peak memory consumption was 183.5 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:13,451 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 125.8 MB. Free memory was 103.0 MB in the beginning and 102.9 MB in the end (delta: 120.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 00:42:13,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.70 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:13,453 INFO L168 Benchmark]: Boogie Preprocessor took 46.50 ms. Allocated memory is still 151.0 MB. Free memory was 118.6 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:13,455 INFO L168 Benchmark]: RCFGBuilder took 297.22 ms. Allocated memory is still 151.0 MB. Free memory was 117.2 MB in the beginning and 104.6 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:13,460 INFO L168 Benchmark]: TraceAbstraction took 17827.77 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 104.2 MB in the beginning and 261.7 MB in the end (delta: -157.5 MB). Peak memory consumption was 159.4 MB. Max. memory is 8.0 GB. [2020-11-07 00:42:13,467 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.24 ms. Allocated memory is still 125.8 MB. Free memory was 103.0 MB in the beginning and 102.9 MB in the end (delta: 120.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 345.70 ms. Allocated memory is still 151.0 MB. Free memory was 127.5 MB in the beginning and 118.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.50 ms. Allocated memory is still 151.0 MB. Free memory was 118.6 MB in the beginning and 117.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 297.22 ms. Allocated memory is still 151.0 MB. Free memory was 117.2 MB in the beginning and 104.6 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17827.77 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 104.2 MB in the beginning and 261.7 MB in the end (delta: -157.5 MB). Peak memory consumption was 159.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 10 <= input - ProcedureContractResult [Line: 6]: Procedure Contract for id Derived contract for procedure id: ((((((((((((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 1) || ((((7 <= \result && \old(x) == x) && \result <= 7) && 7 <= \old(x)) && \old(x) <= 7)) || ((((\result <= 4 && 4 <= \result) && \old(x) == x) && \old(x) <= 4) && 4 <= \old(x))) || ((((5 <= \result && 5 <= \old(x)) && \old(x) <= 5) && \old(x) == x) && \result <= 5)) || (((\old(x) == x && 10 <= \old(x)) && 10 <= \result) && \result <= 10)) || ((((2 <= \result && \old(x) == x) && \result <= 2) && 2 <= \old(x)) && \old(x) <= 2)) || ((((\result <= 3 && 3 <= \old(x)) && \old(x) == x) && \old(x) <= 3) && 3 <= \result)) || ((((\result <= 6 && \old(x) == x) && 6 <= \old(x)) && 6 <= \result) && \old(x) <= 6)) || ((\old(x) == x && \result == 0) && \old(x) == 0)) || ((((\result <= 8 && \old(x) == x) && 8 <= \old(x)) && 8 <= \result) && \old(x) <= 8)) || ((((9 <= \result && \old(x) == x) && \old(x) <= 9) && \result <= 9) && 9 <= \old(x))) || (11 <= \old(x) && \old(x) == x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 14.0s, OverallIterations: 12, TraceHistogramMax: 12, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 380 SDtfs, 734 SDslu, 990 SDs, 0 SdLazy, 2506 SolverSat, 225 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 37 LocationsWithAnnotation, 90 PreInvPairs, 299 NumberOfFragments, 1020 HoareAnnotationTreeSize, 90 FomulaSimplifications, 4396 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 37 FomulaSimplificationsInter, 4214 FormulaSimplificationTreeSizeReductionInter, 2.8s 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...