/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_i10_o10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:54:53,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:54:53,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:54:53,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:54:53,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:54:53,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:54:53,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:54:53,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:54:53,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:54:53,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:54:53,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:54:53,166 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:54:53,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:54:53,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:54:53,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:54:53,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:54:53,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:54:53,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:54:53,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:54:53,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:54:53,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:54:53,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:54:53,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:54:53,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:54:53,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:54:53,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:54:53,188 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:54:53,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:54:53,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:54:53,198 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:54:53,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:54:53,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:54:53,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:54:53,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:54:53,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:54:53,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:54:53,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:54:53,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:54:53,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:54:53,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:54:53,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:54:53,213 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:54:53,234 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:54:53,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:54:53,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:54:53,240 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:54:53,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:54:53,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:54:53,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:54:53,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:54:53,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:54:53,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:54:53,242 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:54:53,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:54:53,243 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:54:53,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:54:53,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:54:53,244 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:54:53,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:54:53,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:54:53,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:54:53,245 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:54:53,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:54:53,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:54:53,245 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:54:53,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:54:53,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:54:53,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:54:53,740 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:54:53,745 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:54:53,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-10-24 00:54:53,844 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db23ec82a/69c712ef89aa410e9ceeb632e9c5d3f3/FLAGa52f3f61b [2020-10-24 00:54:54,512 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:54:54,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_i10_o10-1.c [2020-10-24 00:54:54,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db23ec82a/69c712ef89aa410e9ceeb632e9c5d3f3/FLAGa52f3f61b [2020-10-24 00:54:54,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db23ec82a/69c712ef89aa410e9ceeb632e9c5d3f3 [2020-10-24 00:54:54,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:54:54,925 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:54:54,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:54,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:54:54,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:54:54,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:54" (1/1) ... [2020-10-24 00:54:54,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4181ee81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:54, skipping insertion in model container [2020-10-24 00:54:54,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:54" (1/1) ... [2020-10-24 00:54:54,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:54:54,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:54:55,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:55,240 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:54:55,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:55,275 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:54:55,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55 WrapperNode [2020-10-24 00:54:55,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:55,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:54:55,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:54:55,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:54:55,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... [2020-10-24 00:54:55,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:54:55,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:54:55,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:54:55,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:54:55,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:54:55,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:54:55,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:54:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:54:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:54:55,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:54:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:54:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:54:55,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:54:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:54:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:54:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:54:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:54:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:54:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:54:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:54:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:54:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:54:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:54:55,726 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:54:55,726 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:54:55,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:55 BoogieIcfgContainer [2020-10-24 00:54:55,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:54:55,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:54:55,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:54:55,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:54:55,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:54:54" (1/3) ... [2020-10-24 00:54:55,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae81c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:55, skipping insertion in model container [2020-10-24 00:54:55,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:55" (2/3) ... [2020-10-24 00:54:55,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae81c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:55, skipping insertion in model container [2020-10-24 00:54:55,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:55" (3/3) ... [2020-10-24 00:54:55,741 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i10_o10-1.c [2020-10-24 00:54:55,770 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:54:55,781 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:54:55,812 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:54:55,875 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:54:55,876 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:54:55,876 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:54:55,876 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:54:55,876 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:54:55,876 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:54:55,876 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:54:55,877 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:54:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2020-10-24 00:54:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:54:55,903 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:55,904 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:54:55,905 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:55,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:55,912 INFO L82 PathProgramCache]: Analyzing trace with hash -742560695, now seen corresponding path program 1 times [2020-10-24 00:54:55,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:55,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [168103679] [2020-10-24 00:54:55,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,322 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:54:56,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [168103679] [2020-10-24 00:54:56,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:56,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:56,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047198643] [2020-10-24 00:54:56,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:56,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:56,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:56,356 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2020-10-24 00:54:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:56,743 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-10-24 00:54:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:56,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:54:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:56,755 INFO L225 Difference]: With dead ends: 52 [2020-10-24 00:54:56,755 INFO L226 Difference]: Without dead ends: 32 [2020-10-24 00:54:56,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:56,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-10-24 00:54:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-10-24 00:54:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 00:54:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2020-10-24 00:54:56,813 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2020-10-24 00:54:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:56,813 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2020-10-24 00:54:56,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2020-10-24 00:54:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:54:56,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:56,816 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:54:56,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:54:56,817 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1024612499, now seen corresponding path program 1 times [2020-10-24 00:54:56,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:56,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [221763537] [2020-10-24 00:54:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:56,982 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:54:56,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [221763537] [2020-10-24 00:54:56,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:56,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 00:54:56,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925180007] [2020-10-24 00:54:56,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 00:54:56,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:56,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 00:54:56,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-24 00:54:56,987 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 7 states. [2020-10-24 00:54:57,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:57,278 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2020-10-24 00:54:57,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 00:54:57,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-10-24 00:54:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:57,280 INFO L225 Difference]: With dead ends: 44 [2020-10-24 00:54:57,280 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 00:54:57,282 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:54:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 00:54:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 00:54:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 00:54:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-10-24 00:54:57,295 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 33 [2020-10-24 00:54:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:57,296 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-10-24 00:54:57,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 00:54:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-10-24 00:54:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-24 00:54:57,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:57,298 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:54:57,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:54:57,299 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:57,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1157111945, now seen corresponding path program 2 times [2020-10-24 00:54:57,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:57,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561002020] [2020-10-24 00:54:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:57,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:57,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:57,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:57,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:57,548 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:54:57,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561002020] [2020-10-24 00:54:57,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:57,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 00:54:57,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531804430] [2020-10-24 00:54:57,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:54:57,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:57,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:54:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:54:57,552 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 8 states. [2020-10-24 00:54:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:58,013 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2020-10-24 00:54:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:54:58,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-10-24 00:54:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:58,015 INFO L225 Difference]: With dead ends: 49 [2020-10-24 00:54:58,016 INFO L226 Difference]: Without dead ends: 42 [2020-10-24 00:54:58,016 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:54:58,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-24 00:54:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-24 00:54:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 00:54:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-10-24 00:54:58,029 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 41 [2020-10-24 00:54:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:58,030 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-10-24 00:54:58,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:54:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-10-24 00:54:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 00:54:58,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:58,032 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:54:58,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:54:58,033 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2083092563, now seen corresponding path program 3 times [2020-10-24 00:54:58,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:58,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [437984910] [2020-10-24 00:54:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,276 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:54:58,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [437984910] [2020-10-24 00:54:58,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:58,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:54:58,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420458229] [2020-10-24 00:54:58,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:58,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:58,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:58,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:58,279 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 9 states. [2020-10-24 00:54:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:58,621 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-10-24 00:54:58,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:54:58,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2020-10-24 00:54:58,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:58,623 INFO L225 Difference]: With dead ends: 54 [2020-10-24 00:54:58,623 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 00:54:58,624 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:54:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 00:54:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-24 00:54:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 00:54:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2020-10-24 00:54:58,638 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 49 [2020-10-24 00:54:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:58,638 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2020-10-24 00:54:58,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2020-10-24 00:54:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 00:54:58,640 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:58,641 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:54:58,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:54:58,641 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2025718985, now seen corresponding path program 4 times [2020-10-24 00:54:58,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:58,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1165536728] [2020-10-24 00:54:58,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:58,846 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:54:58,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1165536728] [2020-10-24 00:54:58,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:58,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:54:58,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810572372] [2020-10-24 00:54:58,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:54:58,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:54:58,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:58,850 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 10 states. [2020-10-24 00:54:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:59,368 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-10-24 00:54:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:54:59,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2020-10-24 00:54:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:59,372 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:54:59,372 INFO L226 Difference]: Without dead ends: 52 [2020-10-24 00:54:59,373 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:54:59,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-24 00:54:59,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-10-24 00:54:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-10-24 00:54:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2020-10-24 00:54:59,387 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 57 [2020-10-24 00:54:59,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:59,387 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2020-10-24 00:54:59,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:54:59,387 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2020-10-24 00:54:59,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:54:59,389 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:59,389 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:54:59,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:54:59,390 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:59,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2086365203, now seen corresponding path program 5 times [2020-10-24 00:54:59,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:59,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580203332] [2020-10-24 00:54:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:59,594 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:54:59,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580203332] [2020-10-24 00:54:59,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:59,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:54:59,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082550013] [2020-10-24 00:54:59,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:54:59,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:59,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:54:59,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:54:59,597 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 11 states. [2020-10-24 00:55:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:00,134 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2020-10-24 00:55:00,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:55:00,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2020-10-24 00:55:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:00,138 INFO L225 Difference]: With dead ends: 64 [2020-10-24 00:55:00,138 INFO L226 Difference]: Without dead ends: 57 [2020-10-24 00:55:00,140 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:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-24 00:55:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-10-24 00:55:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-10-24 00:55:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2020-10-24 00:55:00,155 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 65 [2020-10-24 00:55:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:00,156 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2020-10-24 00:55:00,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:55:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2020-10-24 00:55:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:55:00,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:00,158 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:00,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:55:00,158 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:00,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:00,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1881990903, now seen corresponding path program 6 times [2020-10-24 00:55:00,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:00,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004683132] [2020-10-24 00:55:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:00,385 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:00,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004683132] [2020-10-24 00:55:00,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:00,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 00:55:00,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583716358] [2020-10-24 00:55:00,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 00:55:00,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 00:55:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-10-24 00:55:00,388 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 12 states. [2020-10-24 00:55:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:00,946 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2020-10-24 00:55:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 00:55:00,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-10-24 00:55:00,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:00,950 INFO L225 Difference]: With dead ends: 69 [2020-10-24 00:55:00,950 INFO L226 Difference]: Without dead ends: 62 [2020-10-24 00:55:00,951 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:00,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-24 00:55:00,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-24 00:55:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-24 00:55:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-10-24 00:55:00,967 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 73 [2020-10-24 00:55:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:00,967 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-10-24 00:55:00,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 00:55:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-10-24 00:55:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:55:00,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:00,969 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:00,969 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:55:00,970 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1486608429, now seen corresponding path program 7 times [2020-10-24 00:55:00,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:00,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [697174450] [2020-10-24 00:55:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,256 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:01,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [697174450] [2020-10-24 00:55:01,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:01,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:55:01,257 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163906702] [2020-10-24 00:55:01,258 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:55:01,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:55:01,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:55:01,259 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 13 states. [2020-10-24 00:55:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:01,849 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2020-10-24 00:55:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:55:01,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2020-10-24 00:55:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:01,851 INFO L225 Difference]: With dead ends: 74 [2020-10-24 00:55:01,851 INFO L226 Difference]: Without dead ends: 67 [2020-10-24 00:55:01,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:55:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-10-24 00:55:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-10-24 00:55:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 00:55:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2020-10-24 00:55:01,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 81 [2020-10-24 00:55:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:01,887 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2020-10-24 00:55:01,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:55:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2020-10-24 00:55:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-24 00:55:01,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:01,896 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:01,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:55:01,897 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2047124151, now seen corresponding path program 8 times [2020-10-24 00:55:01,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:01,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1788080000] [2020-10-24 00:55:01,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:01,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:02,336 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:02,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1788080000] [2020-10-24 00:55:02,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:02,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:55:02,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793379706] [2020-10-24 00:55:02,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:55:02,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:02,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:55:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:55:02,340 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 14 states. [2020-10-24 00:55:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:02,966 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-10-24 00:55:02,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:55:02,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2020-10-24 00:55:02,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:02,968 INFO L225 Difference]: With dead ends: 79 [2020-10-24 00:55:02,968 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 00:55:02,973 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:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 00:55:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2020-10-24 00:55:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 00:55:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2020-10-24 00:55:03,003 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 89 [2020-10-24 00:55:03,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:03,004 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2020-10-24 00:55:03,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:55:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2020-10-24 00:55:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2020-10-24 00:55:03,011 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:03,011 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:03,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 00:55:03,012 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1811920787, now seen corresponding path program 9 times [2020-10-24 00:55:03,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:03,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590659032] [2020-10-24 00:55:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:55:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:55:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:55:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:55:03,421 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:03,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590659032] [2020-10-24 00:55:03,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:55:03,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-10-24 00:55:03,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096598778] [2020-10-24 00:55:03,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 00:55:03,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:55:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 00:55:03,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:55:03,428 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 15 states. [2020-10-24 00:55:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:55:04,134 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2020-10-24 00:55:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 00:55:04,135 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2020-10-24 00:55:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:55:04,137 INFO L225 Difference]: With dead ends: 84 [2020-10-24 00:55:04,137 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 00:55:04,139 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:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 00:55:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2020-10-24 00:55:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 00:55:04,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2020-10-24 00:55:04,172 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 97 [2020-10-24 00:55:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:55:04,173 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2020-10-24 00:55:04,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 00:55:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2020-10-24 00:55:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-24 00:55:04,175 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:55:04,176 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:04,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 00:55:04,176 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:55:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:55:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1912263049, now seen corresponding path program 10 times [2020-10-24 00:55:04,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:55:04,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1584740009] [2020-10-24 00:55:04,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:55:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:04,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 00:55:04,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 00:55:04,283 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-10-24 00:55:04,283 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 00:55:04,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 00:55:04,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:55:04 BoogieIcfgContainer [2020-10-24 00:55:04,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:55:04,371 INFO L168 Benchmark]: Toolchain (without parser) took 9452.24 ms. Allocated memory was 160.4 MB in the beginning and 231.7 MB in the end (delta: 71.3 MB). Free memory was 137.2 MB in the beginning and 88.4 MB in the end (delta: 48.8 MB). Peak memory consumption was 121.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:04,371 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 125.8 MB. Free memory is still 104.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:55:04,372 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.48 ms. Allocated memory is still 160.4 MB. Free memory was 136.4 MB in the beginning and 127.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:04,373 INFO L168 Benchmark]: Boogie Preprocessor took 38.13 ms. Allocated memory is still 160.4 MB. Free memory was 127.5 MB in the beginning and 126.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:04,374 INFO L168 Benchmark]: RCFGBuilder took 409.42 ms. Allocated memory is still 160.4 MB. Free memory was 126.2 MB in the beginning and 113.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:04,375 INFO L168 Benchmark]: TraceAbstraction took 8636.08 ms. Allocated memory was 160.4 MB in the beginning and 231.7 MB in the end (delta: 71.3 MB). Free memory was 112.9 MB in the beginning and 88.4 MB in the end (delta: 24.5 MB). Peak memory consumption was 97.3 MB. Max. memory is 8.0 GB. [2020-10-24 00:55:04,378 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 125.8 MB. Free memory is still 104.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 346.48 ms. Allocated memory is still 160.4 MB. Free memory was 136.4 MB in the beginning and 127.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 38.13 ms. Allocated memory is still 160.4 MB. Free memory was 127.5 MB in the beginning and 126.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 409.42 ms. Allocated memory is still 160.4 MB. Free memory was 126.2 MB in the beginning and 113.3 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8636.08 ms. Allocated memory was 160.4 MB in the beginning and 231.7 MB in the end (delta: 71.3 MB). Free memory was 112.9 MB in the beginning and 88.4 MB in the end (delta: 24.5 MB). Peak memory consumption was 97.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 = 10; VAL [input=10] [L13] CALL, EXPR id(input) 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] [L13] RET, EXPR id(input) VAL [id(input)=10, input=10] [L13] int result = id(input); VAL [id(input)=10, input=10, result=10] [L14] COND TRUE result == 10 VAL [input=10, result=10] [L15] CALL reach_error() [L4] __assert_fail("0", "id_i10_o10-1.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: 8.4s, OverallIterations: 11, TraceHistogramMax: 11, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 640 SDslu, 572 SDs, 0 SdLazy, 824 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 112368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 450/1140 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...