/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:55:00,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:55:00,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:55:00,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:55:00,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:55:00,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:55:00,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:55:00,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:55:00,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:55:00,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:55:00,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:55:00,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:55:00,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:55:00,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:55:00,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:55:00,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:55:00,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:55:00,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:55:00,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:55:00,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:55:00,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:55:00,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:55:00,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:55:00,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:55:00,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:55:00,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:55:00,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:55:00,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:55:00,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:55:00,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:55:00,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:55:00,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:55:00,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:55:00,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:55:00,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:55:00,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:55:00,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:55:00,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:55:00,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:55:00,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:55:00,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:55:00,732 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:55:00,745 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:55:00,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:55:00,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:55:00,748 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:55:00,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:55:00,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:55:00,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:55:00,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:55:00,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:55:00,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:55:00,749 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:55:00,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:55:00,750 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:55:00,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:55:00,750 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:55:00,751 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:55:00,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:55:00,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:55:00,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:00,751 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:55:00,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:55:00,752 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:55:00,752 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 00:55:01,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:55:01,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:55:01,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:55:01,227 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:55:01,228 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:55:01,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-10-24 00:55:01,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f40e463b/aac81e10e31f411f8c2b151b90204f13/FLAG4f84d04e3 [2020-10-24 00:55:02,093 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:55:02,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i15_o15-2.c [2020-10-24 00:55:02,102 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f40e463b/aac81e10e31f411f8c2b151b90204f13/FLAG4f84d04e3 [2020-10-24 00:55:02,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f40e463b/aac81e10e31f411f8c2b151b90204f13 [2020-10-24 00:55:02,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:55:02,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:55:02,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:02,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:55:02,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:55:02,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ca1ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02, skipping insertion in model container [2020-10-24 00:55:02,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:55:02,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:55:02,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:02,793 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:55:02,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:55:02,829 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:55:02,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02 WrapperNode [2020-10-24 00:55:02,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:55:02,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:55:02,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:55:02,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:55:02,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... [2020-10-24 00:55:02,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:55:02,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:55:02,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:55:02,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:55:02,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:55:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:55:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:55:02,950 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:55:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:55:02,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:55:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:55:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:55:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:55:02,951 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:55:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:55:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:55:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:55:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:55:02,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:55:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:55:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:55:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:55:02,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:55:03,192 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:55:03,192 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:55:03,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:03 BoogieIcfgContainer [2020-10-24 00:55:03,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:55:03,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:55:03,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:55:03,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:55:03,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:55:02" (1/3) ... [2020-10-24 00:55:03,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879324c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:03, skipping insertion in model container [2020-10-24 00:55:03,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:55:02" (2/3) ... [2020-10-24 00:55:03,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2879324c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:55:03, skipping insertion in model container [2020-10-24 00:55:03,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:55:03" (3/3) ... [2020-10-24 00:55:03,236 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i15_o15-2.c [2020-10-24 00:55:03,273 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:55:03,287 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:55:03,308 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:55:03,374 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:55:03,375 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:55:03,375 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:55:03,375 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:55:03,375 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:55:03,375 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:55:03,376 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:55:03,376 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:55:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-24 00:55:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:55:03,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:03,420 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-10-24 00:55:03,420 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:03,436 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-24 00:55:03,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:03,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [433717738] [2020-10-24 00:55:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:55:03,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [433717738] [2020-10-24 00:55:03,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:55:03,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:55:03,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146242917] [2020-10-24 00:55:03,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:55:03,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:55:03,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:55:03,983 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-24 00:55:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:04,288 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-10-24 00:55:04,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:55:04,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:55:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:04,301 INFO L225 Difference]: With dead ends: 50 [2020-10-24 00:55:04,302 INFO L226 Difference]: Without dead ends: 32 [2020-10-24 00:55:04,306 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-10-24 00:55:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-24 00:55:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-24 00:55:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 00:55:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-24 00:55:04,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-24 00:55:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:04,368 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-24 00:55:04,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:55:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-24 00:55:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:55:04,371 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:04,371 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-10-24 00:55:04,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:55:04,372 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:04,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-24 00:55:04,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:04,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [842554662] [2020-10-24 00:55:04,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:55:04,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [842554662] [2020-10-24 00:55:04,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:04,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:55:04,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115898376] [2020-10-24 00:55:04,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:55:04,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:04,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:55:04,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:55:04,582 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-24 00:55:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:04,828 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-24 00:55:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:55:04,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-24 00:55:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:04,831 INFO L225 Difference]: With dead ends: 44 [2020-10-24 00:55:04,831 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:55:04,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:55:04,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:55:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:55:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:55:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-24 00:55:04,846 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-24 00:55:04,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:04,847 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-24 00:55:04,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:55:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-24 00:55:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-24 00:55:04,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:04,849 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-10-24 00:55:04,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:55:04,850 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-24 00:55:04,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:04,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [926631192] [2020-10-24 00:55:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:04,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-24 00:55:05,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [926631192] [2020-10-24 00:55:05,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:05,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:55:05,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113307974] [2020-10-24 00:55:05,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:55:05,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:05,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:55:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:55:05,004 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-24 00:55:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:05,339 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-24 00:55:05,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:55:05,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-24 00:55:05,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:05,341 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:55:05,341 INFO L226 Difference]: Without dead ends: 42 [2020-10-24 00:55:05,342 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-10-24 00:55:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-24 00:55:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-24 00:55:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 00:55:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-24 00:55:05,356 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-24 00:55:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:05,357 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-24 00:55:05,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:55:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-24 00:55:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 00:55:05,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:05,359 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-10-24 00:55:05,360 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:55:05,360 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:05,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-24 00:55:05,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:05,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [973133314] [2020-10-24 00:55:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-10-24 00:55:05,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [973133314] [2020-10-24 00:55:05,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:05,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:55:05,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147757769] [2020-10-24 00:55:05,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:55:05,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:55:05,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:55:05,563 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-24 00:55:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:05,927 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-24 00:55:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:55:05,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-24 00:55:05,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:05,929 INFO L225 Difference]: With dead ends: 54 [2020-10-24 00:55:05,929 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 00:55:05,930 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-10-24 00:55:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 00:55:05,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-24 00:55:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 00:55:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-24 00:55:05,944 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-24 00:55:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:05,944 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-24 00:55:05,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:55:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-24 00:55:05,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 00:55:05,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:05,947 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-10-24 00:55:05,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:55:05,947 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:05,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-24 00:55:05,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:05,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [935906566] [2020-10-24 00:55:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-10-24 00:55:06,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [935906566] [2020-10-24 00:55:06,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:06,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:55:06,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296658087] [2020-10-24 00:55:06,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:55:06,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:06,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:55:06,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:55:06,164 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-24 00:55:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:06,662 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-24 00:55:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:55:06,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-24 00:55:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:06,667 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:55:06,667 INFO L226 Difference]: Without dead ends: 52 [2020-10-24 00:55:06,668 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-10-24 00:55:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-24 00:55:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-24 00:55:06,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-24 00:55:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-24 00:55:06,696 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-24 00:55:06,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:06,700 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-24 00:55:06,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:55:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-24 00:55:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:55:06,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:06,707 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-10-24 00:55:06,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:55:06,707 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-24 00:55:06,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:06,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539643681] [2020-10-24 00:55:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:06,955 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 00:55:06,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539643681] [2020-10-24 00:55:06,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:06,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:55:06,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335815910] [2020-10-24 00:55:06,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:55:06,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:06,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:55:06,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:55:06,958 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-24 00:55:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:07,508 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-24 00:55:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:55:07,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-24 00:55:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:07,515 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:55:07,515 INFO L226 Difference]: Without dead ends: 57 [2020-10-24 00:55:07,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:55:07,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-24 00:55:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-24 00:55:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 00:55:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-24 00:55:07,546 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-24 00:55:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:07,547 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-24 00:55:07,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:55:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-24 00:55:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:55:07,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:07,553 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-10-24 00:55:07,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:55:07,554 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:07,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-24 00:55:07,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:07,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [224908189] [2020-10-24 00:55:07,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-10-24 00:55:07,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [224908189] [2020-10-24 00:55:07,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:07,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:55:07,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674908604] [2020-10-24 00:55:07,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:55:07,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:55:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:55:07,942 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-24 00:55:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:08,548 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-24 00:55:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:55:08,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-24 00:55:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:08,550 INFO L225 Difference]: With dead ends: 69 [2020-10-24 00:55:08,550 INFO L226 Difference]: Without dead ends: 62 [2020-10-24 00:55:08,553 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-10-24 00:55:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-24 00:55:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-24 00:55:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 00:55:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-24 00:55:08,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-24 00:55:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:08,572 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-24 00:55:08,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:55:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-24 00:55:08,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:55:08,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:08,574 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-10-24 00:55:08,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:55:08,575 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:08,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:08,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-24 00:55:08,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:08,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055756714] [2020-10-24 00:55:08,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-10-24 00:55:08,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055756714] [2020-10-24 00:55:08,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:08,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:55:08,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219520865] [2020-10-24 00:55:08,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:55:08,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:08,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:55:08,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:55:08,847 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-24 00:55:09,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:09,498 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-24 00:55:09,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:55:09,500 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-24 00:55:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:09,501 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:55:09,501 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:55:09,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:55:09,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:55:09,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-24 00:55:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 00:55:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 00:55:09,539 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-24 00:55:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:09,539 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 00:55:09,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:55:09,540 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 00:55:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-24 00:55:09,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:09,544 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-10-24 00:55:09,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:55:09,545 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:09,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:09,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-24 00:55:09,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:09,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1223184739] [2020-10-24 00:55:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-10-24 00:55:09,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1223184739] [2020-10-24 00:55:09,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:09,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:55:09,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499499008] [2020-10-24 00:55:09,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:55:09,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:09,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:55:09,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:55:09,966 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-24 00:55:10,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:10,612 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-24 00:55:10,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:55:10,613 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-24 00:55:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:10,614 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:55:10,614 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 00:55:10,616 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-10-24 00:55:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 00:55:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-24 00:55:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 00:55:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-24 00:55:10,633 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-24 00:55:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:10,633 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-24 00:55:10,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:55:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-24 00:55:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:55:10,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:10,635 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-10-24 00:55:10,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:55:10,635 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:10,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:10,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-24 00:55:10,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:10,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1871400632] [2020-10-24 00:55:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:10,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-10-24 00:55:11,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1871400632] [2020-10-24 00:55:11,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:11,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:55:11,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805681866] [2020-10-24 00:55:11,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:55:11,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:55:11,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:11,029 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-24 00:55:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:11,769 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-24 00:55:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:55:11,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-24 00:55:11,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:11,772 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:55:11,772 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:55:11,773 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-10-24 00:55:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:55:11,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-24 00:55:11,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 00:55:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-24 00:55:11,791 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-24 00:55:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:11,792 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-24 00:55:11,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:55:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-24 00:55:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-24 00:55:11,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:11,794 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-10-24 00:55:11,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:55:11,794 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-24 00:55:11,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:11,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383032725] [2020-10-24 00:55:11,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:11,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-10-24 00:55:12,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383032725] [2020-10-24 00:55:12,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:12,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:55:12,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649633829] [2020-10-24 00:55:12,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:55:12,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:12,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:55:12,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:55:12,241 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 16 states. [2020-10-24 00:55:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:13,008 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2020-10-24 00:55:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 00:55:13,009 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2020-10-24 00:55:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:13,011 INFO L225 Difference]: With dead ends: 89 [2020-10-24 00:55:13,011 INFO L226 Difference]: Without dead ends: 82 [2020-10-24 00:55:13,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=544, Unknown=0, NotChecked=0, Total=812 [2020-10-24 00:55:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-24 00:55:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-24 00:55:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 00:55:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-10-24 00:55:13,034 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 105 [2020-10-24 00:55:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:13,034 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-10-24 00:55:13,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:55:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-10-24 00:55:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-10-24 00:55:13,038 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:13,038 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-10-24 00:55:13,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:55:13,038 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash -34990253, now seen corresponding path program 11 times [2020-10-24 00:55:13,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:13,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [487252339] [2020-10-24 00:55:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-10-24 00:55:13,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [487252339] [2020-10-24 00:55:13,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:13,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-10-24 00:55:13,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908140580] [2020-10-24 00:55:13,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 00:55:13,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 00:55:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:55:13,627 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 17 states. [2020-10-24 00:55:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:14,443 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2020-10-24 00:55:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 00:55:14,443 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 113 [2020-10-24 00:55:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:14,445 INFO L225 Difference]: With dead ends: 94 [2020-10-24 00:55:14,445 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 00:55:14,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=621, Unknown=0, NotChecked=0, Total=930 [2020-10-24 00:55:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 00:55:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-24 00:55:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 00:55:14,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2020-10-24 00:55:14,462 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 113 [2020-10-24 00:55:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:14,463 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2020-10-24 00:55:14,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 00:55:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2020-10-24 00:55:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-24 00:55:14,464 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:14,465 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:14,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 00:55:14,465 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash -980060727, now seen corresponding path program 12 times [2020-10-24 00:55:14,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:14,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379593297] [2020-10-24 00:55:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:14,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-10-24 00:55:15,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379593297] [2020-10-24 00:55:15,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:15,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 00:55:15,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218249889] [2020-10-24 00:55:15,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 00:55:15,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 00:55:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2020-10-24 00:55:15,058 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 18 states. [2020-10-24 00:55:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:15,858 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-10-24 00:55:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-24 00:55:15,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2020-10-24 00:55:15,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:15,859 INFO L225 Difference]: With dead ends: 99 [2020-10-24 00:55:15,860 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 00:55:15,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 00:55:15,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 00:55:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-10-24 00:55:15,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-24 00:55:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2020-10-24 00:55:15,875 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 121 [2020-10-24 00:55:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:15,876 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2020-10-24 00:55:15,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 00:55:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2020-10-24 00:55:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-10-24 00:55:15,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:15,878 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:15,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 00:55:15,878 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:15,879 INFO L82 PathProgramCache]: Analyzing trace with hash 366954259, now seen corresponding path program 13 times [2020-10-24 00:55:15,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:15,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [388548747] [2020-10-24 00:55:15,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:15,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,276 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-10-24 00:55:16,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [388548747] [2020-10-24 00:55:16,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:16,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-10-24 00:55:16,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956766802] [2020-10-24 00:55:16,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 00:55:16,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:16,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 00:55:16,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:55:16,531 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 19 states. [2020-10-24 00:55:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:17,635 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2020-10-24 00:55:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 00:55:17,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 129 [2020-10-24 00:55:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:17,638 INFO L225 Difference]: With dead ends: 104 [2020-10-24 00:55:17,638 INFO L226 Difference]: Without dead ends: 97 [2020-10-24 00:55:17,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=400, Invalid=790, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:55:17,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-24 00:55:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-10-24 00:55:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-10-24 00:55:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2020-10-24 00:55:17,656 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 129 [2020-10-24 00:55:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:17,657 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2020-10-24 00:55:17,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 00:55:17,657 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2020-10-24 00:55:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-10-24 00:55:17,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:17,661 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:17,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 00:55:17,662 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:17,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:17,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1919989239, now seen corresponding path program 14 times [2020-10-24 00:55:17,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:17,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [162157545] [2020-10-24 00:55:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:17,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-10-24 00:55:18,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [162157545] [2020-10-24 00:55:18,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:18,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 00:55:18,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408837238] [2020-10-24 00:55:18,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 00:55:18,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:18,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 00:55:18,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=238, Unknown=0, NotChecked=0, Total=380 [2020-10-24 00:55:18,366 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 20 states. [2020-10-24 00:55:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:19,513 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2020-10-24 00:55:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-10-24 00:55:19,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 137 [2020-10-24 00:55:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:19,515 INFO L225 Difference]: With dead ends: 109 [2020-10-24 00:55:19,515 INFO L226 Difference]: Without dead ends: 102 [2020-10-24 00:55:19,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2020-10-24 00:55:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-24 00:55:19,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2020-10-24 00:55:19,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-24 00:55:19,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2020-10-24 00:55:19,535 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 137 [2020-10-24 00:55:19,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:19,536 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2020-10-24 00:55:19,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 00:55:19,536 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2020-10-24 00:55:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-10-24 00:55:19,538 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:19,538 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:55:19,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 00:55:19,538 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:19,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:19,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1315223853, now seen corresponding path program 15 times [2020-10-24 00:55:19,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:19,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [336580703] [2020-10-24 00:55:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:19,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:19,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:19,643 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:55:19,643 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:55:19,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 00:55:19,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:55:19 BoogieIcfgContainer [2020-10-24 00:55:19,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:55:19,741 INFO L168 Benchmark]: Toolchain (without parser) took 17240.35 ms. Allocated memory was 151.0 MB in the beginning and 377.5 MB in the end (delta: 226.5 MB). Free memory was 127.6 MB in the beginning and 240.7 MB in the end (delta: -113.2 MB). Peak memory consumption was 114.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:19,742 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 124.4 MB in the end (delta: 136.3 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:55:19,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.25 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 118.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:19,744 INFO L168 Benchmark]: Boogie Preprocessor took 42.93 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:19,750 INFO L168 Benchmark]: RCFGBuilder took 318.39 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 104.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:19,752 INFO L168 Benchmark]: TraceAbstraction took 16523.60 ms. Allocated memory was 151.0 MB in the beginning and 377.5 MB in the end (delta: 226.5 MB). Free memory was 134.4 MB in the beginning and 240.7 MB in the end (delta: -106.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:19,757 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.30 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 124.4 MB in the end (delta: 136.3 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 321.25 ms. Allocated memory is still 151.0 MB. Free memory was 127.1 MB in the beginning and 118.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.93 ms. Allocated memory is still 151.0 MB. Free memory was 118.0 MB in the beginning and 116.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 318.39 ms. Allocated memory is still 151.0 MB. Free memory was 116.6 MB in the beginning and 104.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16523.60 ms. Allocated memory was 151.0 MB in the beginning and 377.5 MB in the end (delta: 226.5 MB). Free memory was 134.4 MB in the beginning and 240.7 MB in the end (delta: -106.3 MB). Peak memory consumption was 120.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int input = 15; VAL [input=15] [L13] CALL, EXPR id(input) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 VAL [\old(x)=0, x=0] [L7] return 0; VAL [\old(x)=0, \result=0, x=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L8] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L8] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L8] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L8] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L8] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L8] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L8] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L8] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L8] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L8] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L8] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L8] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L8] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L8] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L8] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L8] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L8] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L8] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L8] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L8] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L8] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L8] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L8] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L8] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L8] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L8] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L8] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L8] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L8] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L13] RET, EXPR id(input) VAL [id(input)=15, input=15] [L13] int result = id(input); VAL [id(input)=15, input=15, result=15] [L14] COND TRUE result == 15 VAL [input=15, result=15] [L15] CALL reach_error() [L4] __assert_fail("0", "id_i15_o15-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.2s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 409 SDtfs, 1277 SDslu, 925 SDs, 0 SdLazy, 1466 SolverSat, 402 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 315 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1360 NumberOfCodeBlocks, 1360 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1200 ConstructedInterpolants, 0 QuantifiedInterpolants, 310880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 1575/4060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...