/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_o20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:56:22,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:56:22,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:56:22,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:56:22,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:56:22,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:56:22,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:56:22,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:56:22,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:56:22,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:56:22,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:56:22,057 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:56:22,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:56:22,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:56:22,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:56:22,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:56:22,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:56:22,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:56:22,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:56:22,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:56:22,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:56:22,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:56:22,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:56:22,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:56:22,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:56:22,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:56:22,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:56:22,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:56:22,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:56:22,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:56:22,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:56:22,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:56:22,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:56:22,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:56:22,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:56:22,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:56:22,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:56:22,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:56:22,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:56:22,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:56:22,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:56:22,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:56:22,135 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:56:22,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:56:22,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:56:22,137 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:56:22,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:56:22,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:56:22,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:56:22,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:56:22,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:56:22,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:56:22,142 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:56:22,142 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:56:22,142 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:56:22,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:56:22,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:56:22,143 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:56:22,143 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:56:22,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:56:22,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:56:22,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:56:22,144 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:56:22,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:56:22,144 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-09-04 21:56:22,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:56:22,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:56:22,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:56:22,664 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:56:22,665 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:56:22,666 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c [2020-09-04 21:56:22,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8cbef0a6c/e64d52539c234a3488e919d274274558/FLAGc4e52e5f2 [2020-09-04 21:56:23,298 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:56:23,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/id_o20.c [2020-09-04 21:56:23,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8cbef0a6c/e64d52539c234a3488e919d274274558/FLAGc4e52e5f2 [2020-09-04 21:56:23,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8cbef0a6c/e64d52539c234a3488e919d274274558 [2020-09-04 21:56:23,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:56:23,678 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:56:23,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:56:23,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:56:23,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:56:23,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:23,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d5031f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23, skipping insertion in model container [2020-09-04 21:56:23,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:23,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:56:23,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:56:23,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:56:23,964 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:56:23,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:56:23,998 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:56:23,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23 WrapperNode [2020-09-04 21:56:23,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:56:23,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:56:24,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:56:24,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:56:24,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... [2020-09-04 21:56:24,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:56:24,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:56:24,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:56:24,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:56:24,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:56:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:56:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:56:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-09-04 21:56:24,209 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:56:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-09-04 21:56:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:56:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-09-04 21:56:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:56:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:56:24,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:56:24,391 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:56:24,391 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:56:24,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:56:24 BoogieIcfgContainer [2020-09-04 21:56:24,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:56:24,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:56:24,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:56:24,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:56:24,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:56:23" (1/3) ... [2020-09-04 21:56:24,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa32b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:56:24, skipping insertion in model container [2020-09-04 21:56:24,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:56:23" (2/3) ... [2020-09-04 21:56:24,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36aa32b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:56:24, skipping insertion in model container [2020-09-04 21:56:24,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:56:24" (3/3) ... [2020-09-04 21:56:24,407 INFO L109 eAbstractionObserver]: Analyzing ICFG id_o20.c [2020-09-04 21:56:24,419 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:56:24,429 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:56:24,452 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:56:24,480 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:56:24,480 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:56:24,481 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:56:24,481 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:56:24,481 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:56:24,481 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:56:24,481 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:56:24,481 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:56:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-04 21:56:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:56:24,508 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:24,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:24,510 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:24,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1651991454, now seen corresponding path program 1 times [2020-09-04 21:56:24,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:24,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [547244564] [2020-09-04 21:56:24,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:56:24,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [547244564] [2020-09-04 21:56:24,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:56:24,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:56:24,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903719659] [2020-09-04 21:56:24,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:56:24,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:56:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:56:24,921 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-04 21:56:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:25,006 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-09-04 21:56:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:56:25,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:56:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:25,021 INFO L225 Difference]: With dead ends: 37 [2020-09-04 21:56:25,021 INFO L226 Difference]: Without dead ends: 22 [2020-09-04 21:56:25,026 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:56:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-09-04 21:56:25,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-09-04 21:56:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-09-04 21:56:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-09-04 21:56:25,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2020-09-04 21:56:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:25,077 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-09-04 21:56:25,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:56:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-09-04 21:56:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-09-04 21:56:25,079 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:25,080 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] [2020-09-04 21:56:25,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:56:25,081 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash 189324707, now seen corresponding path program 1 times [2020-09-04 21:56:25,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:25,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061608858] [2020-09-04 21:56:25,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:56:25,299 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061608858] [2020-09-04 21:56:25,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:25,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:56:25,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262299537] [2020-09-04 21:56:25,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:56:25,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:56:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:56:25,303 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 7 states. [2020-09-04 21:56:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:25,378 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2020-09-04 21:56:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:56:25,379 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-09-04 21:56:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:25,380 INFO L225 Difference]: With dead ends: 31 [2020-09-04 21:56:25,381 INFO L226 Difference]: Without dead ends: 26 [2020-09-04 21:56:25,382 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:56:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-09-04 21:56:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-09-04 21:56:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-09-04 21:56:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2020-09-04 21:56:25,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 23 [2020-09-04 21:56:25,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:25,393 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2020-09-04 21:56:25,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:56:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2020-09-04 21:56:25,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-09-04 21:56:25,395 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:25,395 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:25,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:56:25,396 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:25,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1416732684, now seen corresponding path program 2 times [2020-09-04 21:56:25,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:25,397 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638611188] [2020-09-04 21:56:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-09-04 21:56:25,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638611188] [2020-09-04 21:56:25,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:25,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:56:25,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145843608] [2020-09-04 21:56:25,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:56:25,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:25,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:56:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:56:25,672 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2020-09-04 21:56:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:25,799 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2020-09-04 21:56:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:56:25,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-09-04 21:56:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:25,801 INFO L225 Difference]: With dead ends: 35 [2020-09-04 21:56:25,802 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:56:25,803 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:56:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:56:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:56:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:56:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 21:56:25,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 30 [2020-09-04 21:56:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:25,813 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 21:56:25,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:56:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 21:56:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 21:56:25,815 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:25,815 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:25,815 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:56:25,816 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:25,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash -209476043, now seen corresponding path program 3 times [2020-09-04 21:56:25,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:25,817 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291380745] [2020-09-04 21:56:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:25,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-09-04 21:56:26,217 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291380745] [2020-09-04 21:56:26,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:26,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:56:26,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243648343] [2020-09-04 21:56:26,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:56:26,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:26,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:56:26,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:56:26,220 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 11 states. [2020-09-04 21:56:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:26,364 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2020-09-04 21:56:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 21:56:26,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-09-04 21:56:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:26,366 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:56:26,366 INFO L226 Difference]: Without dead ends: 34 [2020-09-04 21:56:26,367 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:56:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-09-04 21:56:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-09-04 21:56:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-09-04 21:56:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2020-09-04 21:56:26,377 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 37 [2020-09-04 21:56:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:26,378 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2020-09-04 21:56:26,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:56:26,378 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2020-09-04 21:56:26,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-09-04 21:56:26,379 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:26,380 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:26,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:56:26,380 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:26,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:26,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1007399302, now seen corresponding path program 4 times [2020-09-04 21:56:26,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:26,381 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [439477215] [2020-09-04 21:56:26,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 21:56:26,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [439477215] [2020-09-04 21:56:26,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:26,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:56:26,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250220868] [2020-09-04 21:56:26,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:56:26,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:26,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:56:26,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:56:26,763 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 13 states. [2020-09-04 21:56:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:26,951 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-09-04 21:56:26,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:56:26,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2020-09-04 21:56:26,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:26,953 INFO L225 Difference]: With dead ends: 43 [2020-09-04 21:56:26,953 INFO L226 Difference]: Without dead ends: 38 [2020-09-04 21:56:26,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:56:26,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-09-04 21:56:26,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-09-04 21:56:26,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-09-04 21:56:26,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2020-09-04 21:56:26,964 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 44 [2020-09-04 21:56:26,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:26,965 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2020-09-04 21:56:26,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:56:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2020-09-04 21:56:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:56:26,967 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:26,967 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:26,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:56:26,968 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:26,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:26,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1787659065, now seen corresponding path program 5 times [2020-09-04 21:56:26,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:26,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [957763101] [2020-09-04 21:56:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,320 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-09-04 21:56:27,321 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [957763101] [2020-09-04 21:56:27,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:27,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:56:27,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134680414] [2020-09-04 21:56:27,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:56:27,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:56:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:56:27,323 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 15 states. [2020-09-04 21:56:27,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:27,580 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-09-04 21:56:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 21:56:27,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2020-09-04 21:56:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:27,583 INFO L225 Difference]: With dead ends: 47 [2020-09-04 21:56:27,583 INFO L226 Difference]: Without dead ends: 42 [2020-09-04 21:56:27,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:56:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-09-04 21:56:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-09-04 21:56:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:56:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2020-09-04 21:56:27,594 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 51 [2020-09-04 21:56:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:27,594 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2020-09-04 21:56:27,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:56:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2020-09-04 21:56:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-09-04 21:56:27,596 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:27,596 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:27,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:56:27,597 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:27,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1360883432, now seen corresponding path program 6 times [2020-09-04 21:56:27,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:27,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [208911816] [2020-09-04 21:56:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:27,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2020-09-04 21:56:28,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [208911816] [2020-09-04 21:56:28,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:28,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-09-04 21:56:28,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261178625] [2020-09-04 21:56:28,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 21:56:28,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:28,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 21:56:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:56:28,026 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 17 states. [2020-09-04 21:56:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:28,319 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 21:56:28,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:56:28,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 58 [2020-09-04 21:56:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:28,321 INFO L225 Difference]: With dead ends: 51 [2020-09-04 21:56:28,322 INFO L226 Difference]: Without dead ends: 46 [2020-09-04 21:56:28,323 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:56:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-09-04 21:56:28,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-09-04 21:56:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-09-04 21:56:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2020-09-04 21:56:28,332 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 58 [2020-09-04 21:56:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:28,332 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2020-09-04 21:56:28,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 21:56:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2020-09-04 21:56:28,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-09-04 21:56:28,334 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:28,334 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:28,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:56:28,335 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:28,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -807968423, now seen corresponding path program 7 times [2020-09-04 21:56:28,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:28,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1460481952] [2020-09-04 21:56:28,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 21:56:28,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1460481952] [2020-09-04 21:56:28,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:28,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-09-04 21:56:28,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905524885] [2020-09-04 21:56:28,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 21:56:28,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:28,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 21:56:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:56:28,867 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 19 states. [2020-09-04 21:56:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:29,217 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2020-09-04 21:56:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:56:29,218 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2020-09-04 21:56:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:29,220 INFO L225 Difference]: With dead ends: 55 [2020-09-04 21:56:29,222 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:56:29,223 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:56:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:56:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:56:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:56:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 21:56:29,235 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 65 [2020-09-04 21:56:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:29,235 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 21:56:29,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 21:56:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 21:56:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 21:56:29,237 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:29,237 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:29,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:56:29,238 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -705364310, now seen corresponding path program 8 times [2020-09-04 21:56:29,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:29,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936394487] [2020-09-04 21:56:29,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2020-09-04 21:56:29,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936394487] [2020-09-04 21:56:29,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:29,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-09-04 21:56:29,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393401619] [2020-09-04 21:56:29,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 21:56:29,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:29,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 21:56:29,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:56:29,833 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 21 states. [2020-09-04 21:56:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:30,300 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2020-09-04 21:56:30,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 21:56:30,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2020-09-04 21:56:30,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:30,302 INFO L225 Difference]: With dead ends: 59 [2020-09-04 21:56:30,303 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 21:56:30,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:56:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 21:56:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-09-04 21:56:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 21:56:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2020-09-04 21:56:30,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 72 [2020-09-04 21:56:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:30,314 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2020-09-04 21:56:30,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 21:56:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-09-04 21:56:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 21:56:30,316 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:30,316 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:30,316 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:56:30,316 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:30,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1418439701, now seen corresponding path program 9 times [2020-09-04 21:56:30,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:30,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369250396] [2020-09-04 21:56:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:30,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2020-09-04 21:56:31,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369250396] [2020-09-04 21:56:31,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:31,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-09-04 21:56:31,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732980160] [2020-09-04 21:56:31,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 21:56:31,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 21:56:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2020-09-04 21:56:31,092 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 23 states. [2020-09-04 21:56:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:31,742 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2020-09-04 21:56:31,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-09-04 21:56:31,743 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2020-09-04 21:56:31,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:31,745 INFO L225 Difference]: With dead ends: 63 [2020-09-04 21:56:31,745 INFO L226 Difference]: Without dead ends: 58 [2020-09-04 21:56:31,746 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 21:56:31,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-09-04 21:56:31,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2020-09-04 21:56:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-09-04 21:56:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2020-09-04 21:56:31,758 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 79 [2020-09-04 21:56:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:31,758 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2020-09-04 21:56:31,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 21:56:31,758 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2020-09-04 21:56:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-09-04 21:56:31,760 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:31,761 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:31,761 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:56:31,761 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:31,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:31,762 INFO L82 PathProgramCache]: Analyzing trace with hash -182126020, now seen corresponding path program 10 times [2020-09-04 21:56:31,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:31,762 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002867139] [2020-09-04 21:56:31,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:31,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:31,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:31,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2020-09-04 21:56:32,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002867139] [2020-09-04 21:56:32,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:32,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:56:32,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577442219] [2020-09-04 21:56:32,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:56:32,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:56:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:56:32,641 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 25 states. [2020-09-04 21:56:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:33,244 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2020-09-04 21:56:33,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-09-04 21:56:33,245 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 86 [2020-09-04 21:56:33,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:33,246 INFO L225 Difference]: With dead ends: 67 [2020-09-04 21:56:33,247 INFO L226 Difference]: Without dead ends: 62 [2020-09-04 21:56:33,248 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 21:56:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-09-04 21:56:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-09-04 21:56:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-09-04 21:56:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2020-09-04 21:56:33,259 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 86 [2020-09-04 21:56:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:33,259 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2020-09-04 21:56:33,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:56:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2020-09-04 21:56:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-09-04 21:56:33,260 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:33,261 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:33,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:56:33,261 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1527469181, now seen corresponding path program 11 times [2020-09-04 21:56:33,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:33,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [492597343] [2020-09-04 21:56:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:33,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:34,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2020-09-04 21:56:34,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [492597343] [2020-09-04 21:56:34,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:34,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2020-09-04 21:56:34,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353383429] [2020-09-04 21:56:34,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 21:56:34,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:34,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 21:56:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2020-09-04 21:56:34,212 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 27 states. [2020-09-04 21:56:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:34,909 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 21:56:34,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-09-04 21:56:34,909 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 93 [2020-09-04 21:56:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:34,910 INFO L225 Difference]: With dead ends: 71 [2020-09-04 21:56:34,911 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 21:56:34,912 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1383, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 21:56:34,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 21:56:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-09-04 21:56:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 21:56:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2020-09-04 21:56:34,929 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 93 [2020-09-04 21:56:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:34,929 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2020-09-04 21:56:34,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 21:56:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2020-09-04 21:56:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-09-04 21:56:34,931 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:34,931 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:34,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:56:34,932 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1034648626, now seen corresponding path program 12 times [2020-09-04 21:56:34,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:34,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1789814837] [2020-09-04 21:56:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:35,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2020-09-04 21:56:36,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1789814837] [2020-09-04 21:56:36,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:36,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2020-09-04 21:56:36,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705488625] [2020-09-04 21:56:36,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 21:56:36,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 21:56:36,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:56:36,045 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 29 states. [2020-09-04 21:56:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:36,907 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2020-09-04 21:56:36,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-09-04 21:56:36,908 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 100 [2020-09-04 21:56:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:36,909 INFO L225 Difference]: With dead ends: 75 [2020-09-04 21:56:36,909 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:56:36,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=1615, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 21:56:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:56:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:56:36,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:56:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 21:56:36,924 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 100 [2020-09-04 21:56:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:36,924 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 21:56:36,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 21:56:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 21:56:36,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-09-04 21:56:36,927 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:36,927 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:36,928 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:56:36,928 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:36,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:36,928 INFO L82 PathProgramCache]: Analyzing trace with hash 996041487, now seen corresponding path program 13 times [2020-09-04 21:56:36,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:36,934 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1265219042] [2020-09-04 21:56:36,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:37,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:38,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:38,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2020-09-04 21:56:38,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1265219042] [2020-09-04 21:56:38,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:38,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-09-04 21:56:38,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277956031] [2020-09-04 21:56:38,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-09-04 21:56:38,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:38,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-09-04 21:56:38,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2020-09-04 21:56:38,267 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 31 states. [2020-09-04 21:56:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:39,263 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2020-09-04 21:56:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-09-04 21:56:39,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 107 [2020-09-04 21:56:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:39,265 INFO L225 Difference]: With dead ends: 79 [2020-09-04 21:56:39,265 INFO L226 Difference]: Without dead ends: 74 [2020-09-04 21:56:39,266 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=115, Invalid=1865, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 21:56:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-09-04 21:56:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-09-04 21:56:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-09-04 21:56:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2020-09-04 21:56:39,274 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 107 [2020-09-04 21:56:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:39,275 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2020-09-04 21:56:39,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-09-04 21:56:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2020-09-04 21:56:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-09-04 21:56:39,276 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:39,276 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:39,276 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 21:56:39,276 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:39,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1701157728, now seen corresponding path program 14 times [2020-09-04 21:56:39,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:39,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [454586586] [2020-09-04 21:56:39,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:39,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2020-09-04 21:56:40,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [454586586] [2020-09-04 21:56:40,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:40,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2020-09-04 21:56:40,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88738171] [2020-09-04 21:56:40,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-09-04 21:56:40,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-09-04 21:56:40,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 21:56:40,622 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 33 states. [2020-09-04 21:56:41,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:41,862 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2020-09-04 21:56:41,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-09-04 21:56:41,863 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 114 [2020-09-04 21:56:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:41,864 INFO L225 Difference]: With dead ends: 83 [2020-09-04 21:56:41,864 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:56:41,865 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=2133, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 21:56:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:56:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 21:56:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 21:56:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2020-09-04 21:56:41,873 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 114 [2020-09-04 21:56:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:41,874 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2020-09-04 21:56:41,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-09-04 21:56:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2020-09-04 21:56:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 21:56:41,875 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:41,875 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:41,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 21:56:41,876 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:41,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:41,876 INFO L82 PathProgramCache]: Analyzing trace with hash -751861855, now seen corresponding path program 15 times [2020-09-04 21:56:41,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:41,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2117337974] [2020-09-04 21:56:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:41,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:41,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:42,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:43,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:43,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:43,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2020-09-04 21:56:43,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2117337974] [2020-09-04 21:56:43,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:43,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2020-09-04 21:56:43,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237215264] [2020-09-04 21:56:43,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-09-04 21:56:43,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-09-04 21:56:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2020-09-04 21:56:43,381 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 35 states. [2020-09-04 21:56:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:44,747 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2020-09-04 21:56:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-09-04 21:56:44,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 121 [2020-09-04 21:56:44,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:44,751 INFO L225 Difference]: With dead ends: 87 [2020-09-04 21:56:44,751 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 21:56:44,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=2419, Unknown=0, NotChecked=0, Total=2550 [2020-09-04 21:56:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 21:56:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-09-04 21:56:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-09-04 21:56:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2020-09-04 21:56:44,764 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 121 [2020-09-04 21:56:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:44,767 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2020-09-04 21:56:44,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-09-04 21:56:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2020-09-04 21:56:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2020-09-04 21:56:44,769 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:44,769 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:44,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 21:56:44,769 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:44,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:44,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2017083634, now seen corresponding path program 16 times [2020-09-04 21:56:44,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:44,770 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658548838] [2020-09-04 21:56:44,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:44,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:44,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:44,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:45,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:46,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:46,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:46,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:46,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2020-09-04 21:56:46,475 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658548838] [2020-09-04 21:56:46,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:46,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-09-04 21:56:46,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692244741] [2020-09-04 21:56:46,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-09-04 21:56:46,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-09-04 21:56:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2020-09-04 21:56:46,480 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 37 states. [2020-09-04 21:56:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:48,025 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 21:56:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2020-09-04 21:56:48,026 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 128 [2020-09-04 21:56:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:48,027 INFO L225 Difference]: With dead ends: 91 [2020-09-04 21:56:48,027 INFO L226 Difference]: Without dead ends: 86 [2020-09-04 21:56:48,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=139, Invalid=2723, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 21:56:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-09-04 21:56:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-09-04 21:56:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-09-04 21:56:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2020-09-04 21:56:48,037 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 128 [2020-09-04 21:56:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:48,038 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2020-09-04 21:56:48,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-09-04 21:56:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2020-09-04 21:56:48,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 21:56:48,040 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:48,043 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:48,043 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 21:56:48,043 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash -750736845, now seen corresponding path program 17 times [2020-09-04 21:56:48,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:48,044 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [329138845] [2020-09-04 21:56:48,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:48,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2020-09-04 21:56:49,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [329138845] [2020-09-04 21:56:49,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:49,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2020-09-04 21:56:49,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120624866] [2020-09-04 21:56:49,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2020-09-04 21:56:49,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:49,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2020-09-04 21:56:49,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 21:56:49,872 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 39 states. [2020-09-04 21:56:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:51,603 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2020-09-04 21:56:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2020-09-04 21:56:51,603 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 135 [2020-09-04 21:56:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:51,605 INFO L225 Difference]: With dead ends: 95 [2020-09-04 21:56:51,605 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 21:56:51,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=147, Invalid=3045, Unknown=0, NotChecked=0, Total=3192 [2020-09-04 21:56:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 21:56:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 21:56:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 21:56:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 21:56:51,613 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 21:56:51,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:51,614 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 21:56:51,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 39 states. [2020-09-04 21:56:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 21:56:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-04 21:56:51,616 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:51,616 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:51,616 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 21:56:51,616 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash 112489604, now seen corresponding path program 18 times [2020-09-04 21:56:51,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:51,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [590406555] [2020-09-04 21:56:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:51,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:51,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:51,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:51,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:51,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:52,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:53,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:53,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:53,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:53,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2020-09-04 21:56:53,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [590406555] [2020-09-04 21:56:53,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:53,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2020-09-04 21:56:53,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665749169] [2020-09-04 21:56:53,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-09-04 21:56:53,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:53,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-09-04 21:56:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2020-09-04 21:56:53,611 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 41 states. [2020-09-04 21:56:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:55,538 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2020-09-04 21:56:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2020-09-04 21:56:55,539 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 142 [2020-09-04 21:56:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:55,540 INFO L225 Difference]: With dead ends: 99 [2020-09-04 21:56:55,540 INFO L226 Difference]: Without dead ends: 94 [2020-09-04 21:56:55,544 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=3385, Unknown=0, NotChecked=0, Total=3540 [2020-09-04 21:56:55,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-09-04 21:56:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2020-09-04 21:56:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-09-04 21:56:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2020-09-04 21:56:55,552 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 142 [2020-09-04 21:56:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:55,553 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2020-09-04 21:56:55,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-09-04 21:56:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2020-09-04 21:56:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-09-04 21:56:55,555 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:55,555 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:55,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 21:56:55,555 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 374596293, now seen corresponding path program 19 times [2020-09-04 21:56:55,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:55,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441894347] [2020-09-04 21:56:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:56:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:55,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:56:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:55,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 21:56:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:55,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:55,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:55,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:56,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-09-04 21:56:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:56:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2020-09-04 21:56:57,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441894347] [2020-09-04 21:56:57,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:56:57,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2020-09-04 21:56:57,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095043772] [2020-09-04 21:56:57,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2020-09-04 21:56:57,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:56:57,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2020-09-04 21:56:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2020-09-04 21:56:57,796 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 43 states. [2020-09-04 21:56:59,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:56:59,923 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2020-09-04 21:56:59,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2020-09-04 21:56:59,924 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 149 [2020-09-04 21:56:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:56:59,927 INFO L225 Difference]: With dead ends: 103 [2020-09-04 21:56:59,927 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 21:56:59,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=163, Invalid=3743, Unknown=0, NotChecked=0, Total=3906 [2020-09-04 21:56:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 21:56:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-09-04 21:56:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-09-04 21:56:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2020-09-04 21:56:59,937 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 149 [2020-09-04 21:56:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:56:59,938 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2020-09-04 21:56:59,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 43 states. [2020-09-04 21:56:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2020-09-04 21:56:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-09-04 21:56:59,940 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:56:59,940 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:56:59,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 21:56:59,940 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:56:59,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:56:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1900661226, now seen corresponding path program 20 times [2020-09-04 21:56:59,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:56:59,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638514891] [2020-09-04 21:56:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:57:00,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:57:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:57:00,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:57:00,232 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:57:00,233 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:57:00,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 21:57:00,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:57:00 BoogieIcfgContainer [2020-09-04 21:57:00,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:57:00,340 INFO L168 Benchmark]: Toolchain (without parser) took 36656.90 ms. Allocated memory was 146.3 MB in the beginning and 513.3 MB in the end (delta: 367.0 MB). Free memory was 103.4 MB in the beginning and 478.5 MB in the end (delta: -375.1 MB). Peak memory consumption was 383.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:00,341 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.4 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-09-04 21:57:00,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.58 ms. Allocated memory is still 146.3 MB. Free memory was 103.0 MB in the beginning and 93.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:00,344 INFO L168 Benchmark]: Boogie Preprocessor took 28.22 ms. Allocated memory is still 146.3 MB. Free memory was 93.9 MB in the beginning and 92.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:00,344 INFO L168 Benchmark]: RCFGBuilder took 368.70 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.6 MB in the beginning and 170.9 MB in the end (delta: -78.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:00,345 INFO L168 Benchmark]: TraceAbstraction took 35934.63 ms. Allocated memory was 202.9 MB in the beginning and 513.3 MB in the end (delta: 310.4 MB). Free memory was 170.9 MB in the beginning and 478.5 MB in the end (delta: -307.6 MB). Peak memory consumption was 393.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:57:00,352 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.4 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.58 ms. Allocated memory is still 146.3 MB. Free memory was 103.0 MB in the beginning and 93.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.22 ms. Allocated memory is still 146.3 MB. Free memory was 93.9 MB in the beginning and 92.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 368.70 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.6 MB in the beginning and 170.9 MB in the end (delta: -78.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35934.63 ms. Allocated memory was 202.9 MB in the beginning and 513.3 MB in the end (delta: 310.4 MB). Free memory was 170.9 MB in the beginning and 478.5 MB in the end (delta: -307.6 MB). Peak memory consumption was 393.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] unsigned int input = __VERIFIER_nondet_uint(); VAL [__VERIFIER_nondet_uint()=20, input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 VAL [\old(x)=0, x=0] [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; VAL [\old(x)=1, \result=1, id(x-1)=0, x=1] [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; VAL [\old(x)=2, \result=2, id(x-1)=1, x=2] [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; VAL [\old(x)=3, \result=3, id(x-1)=2, x=3] [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; VAL [\old(x)=4, \result=4, id(x-1)=3, x=4] [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; VAL [\old(x)=5, \result=5, id(x-1)=4, x=5] [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; VAL [\old(x)=6, \result=6, id(x-1)=5, x=6] [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; VAL [\old(x)=7, \result=7, id(x-1)=6, x=7] [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; VAL [\old(x)=8, \result=8, id(x-1)=7, x=8] [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; VAL [\old(x)=9, \result=9, id(x-1)=8, x=9] [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; VAL [\old(x)=10, \result=10, id(x-1)=9, x=10] [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; VAL [\old(x)=11, \result=11, id(x-1)=10, x=11] [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; VAL [\old(x)=12, \result=12, id(x-1)=11, x=12] [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; VAL [\old(x)=13, \result=13, id(x-1)=12, x=13] [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; VAL [\old(x)=14, \result=14, id(x-1)=13, x=14] [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; VAL [\old(x)=15, \result=15, id(x-1)=14, x=15] [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; VAL [\old(x)=16, \result=16, id(x-1)=15, x=16] [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; VAL [\old(x)=17, \result=17, id(x-1)=16, x=17] [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; VAL [\old(x)=18, \result=18, id(x-1)=17, x=18] [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; VAL [\old(x)=19, \result=19, id(x-1)=18, x=19] [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; VAL [\old(x)=20, \result=20, id(x-1)=19, x=20] [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] unsigned int result = id(input); VAL [id(input)=20, input=20, result=20] [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.7s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 935 SDtfs, 212 SDslu, 18686 SDs, 0 SdLazy, 10957 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1150 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 650 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 17.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 1806 NumberOfCodeBlocks, 1806 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1630 ConstructedInterpolants, 0 QuantifiedInterpolants, 710730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/8740 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...