/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 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 13:19:44,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:19:44,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:19:44,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:19:44,106 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:19:44,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:19:44,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:19:44,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:19:44,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:19:44,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:19:44,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:19:44,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:19:44,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:19:44,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:19:44,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:19:44,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:19:44,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:19:44,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:19:44,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:19:44,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:19:44,164 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:19:44,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:19:44,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:19:44,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:19:44,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:19:44,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:19:44,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:19:44,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:19:44,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:19:44,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:19:44,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:19:44,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:19:44,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:19:44,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:19:44,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:19:44,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:19:44,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:19:44,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:19:44,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:19:44,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:19:44,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:19:44,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:19:44,249 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:19:44,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:19:44,252 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:19:44,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:19:44,253 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:19:44,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:19:44,253 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:19:44,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:19:44,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:19:44,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:19:44,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:19:44,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:19:44,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:19:44,257 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:19:44,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:19:44,257 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:19:44,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:19:44,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:19:44,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:19:44,258 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:19:44,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:19:44,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:19:44,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:19:44,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:19:44,259 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:19:44,259 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:19:44,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:19:44,260 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:19:44,260 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:19:44,260 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:19:44,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:19:44,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:19:44,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:19:44,798 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:19:44,798 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:19:44,800 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-09-04 13:19:44,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7a3f66618/c2e0f8c8e783433c9903a81244c11879/FLAGed99e7638 [2020-09-04 13:19:45,532 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:19:45,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2020-09-04 13:19:45,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7a3f66618/c2e0f8c8e783433c9903a81244c11879/FLAGed99e7638 [2020-09-04 13:19:45,869 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/7a3f66618/c2e0f8c8e783433c9903a81244c11879 [2020-09-04 13:19:45,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:19:45,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:19:45,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:19:45,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:19:45,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:19:45,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:19:45" (1/1) ... [2020-09-04 13:19:45,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d064956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:45, skipping insertion in model container [2020-09-04 13:19:45,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:19:45" (1/1) ... [2020-09-04 13:19:45,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:19:45,944 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:19:46,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:19:46,207 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:19:46,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:19:46,248 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:19:46,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46 WrapperNode [2020-09-04 13:19:46,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:19:46,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:19:46,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:19:46,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:19:46,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (1/1) ... [2020-09-04 13:19:46,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:19:46,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:19:46,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:19:46,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:19:46,440 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (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 13:19:46,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:19:46,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:19:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-09-04 13:19:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-09-04 13:19:46,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:19:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:19:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:19:46,538 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-09-04 13:19:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-09-04 13:19:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:19:46,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:19:46,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:19:46,820 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:19:46,821 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:19:46,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:19:46 BoogieIcfgContainer [2020-09-04 13:19:46,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:19:46,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:19:46,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:19:46,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:19:46,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:19:45" (1/3) ... [2020-09-04 13:19:46,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e19309c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:19:46, skipping insertion in model container [2020-09-04 13:19:46,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:19:46" (2/3) ... [2020-09-04 13:19:46,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e19309c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:19:46, skipping insertion in model container [2020-09-04 13:19:46,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:19:46" (3/3) ... [2020-09-04 13:19:46,876 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2020-09-04 13:19:46,926 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:19:46,961 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:19:47,005 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:19:47,052 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:19:47,052 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:19:47,052 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:19:47,053 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:19:47,053 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:19:47,053 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:19:47,053 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:19:47,053 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:19:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-09-04 13:19:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-04 13:19:47,085 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:47,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:47,087 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-09-04 13:19:47,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:47,113 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403760400] [2020-09-04 13:19:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:47,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:47,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:47,415 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 13:19:47,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403760400] [2020-09-04 13:19:47,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:19:47,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:19:47,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956239994] [2020-09-04 13:19:47,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:19:47,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:19:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:19:47,458 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-09-04 13:19:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:47,616 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-09-04 13:19:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:19:47,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-04 13:19:47,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:47,637 INFO L225 Difference]: With dead ends: 44 [2020-09-04 13:19:47,638 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 13:19:47,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:19:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 13:19:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 13:19:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 13:19:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-09-04 13:19:47,717 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-09-04 13:19:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:47,718 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-09-04 13:19:47,718 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:19:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-09-04 13:19:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:19:47,721 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:47,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:47,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:19:47,723 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-09-04 13:19:47,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:47,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459300307] [2020-09-04 13:19:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:47,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:47,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:47,859 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 13:19:47,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459300307] [2020-09-04 13:19:47,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:19:47,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:19:47,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459927298] [2020-09-04 13:19:47,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:19:47,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:19:47,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:19:47,875 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-09-04 13:19:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:48,022 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-09-04 13:19:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:19:48,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:19:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:48,028 INFO L225 Difference]: With dead ends: 36 [2020-09-04 13:19:48,028 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 13:19:48,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:19:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 13:19:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-09-04 13:19:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 13:19:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-09-04 13:19:48,071 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-09-04 13:19:48,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:48,072 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-09-04 13:19:48,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:19:48,072 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-09-04 13:19:48,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:19:48,074 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:48,076 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:48,078 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:19:48,078 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:48,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-09-04 13:19:48,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:48,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408270548] [2020-09-04 13:19:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:48,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:48,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:48,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:48,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:19:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:48,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:19:48,346 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408270548] [2020-09-04 13:19:48,347 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323987320] [2020-09-04 13:19:48,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:48,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:19:48,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:19:48,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:48,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-09-04 13:19:48,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784349323] [2020-09-04 13:19:48,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:19:48,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:19:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:19:48,594 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2020-09-04 13:19:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:48,912 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-09-04 13:19:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 13:19:48,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-09-04 13:19:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:48,915 INFO L225 Difference]: With dead ends: 58 [2020-09-04 13:19:48,915 INFO L226 Difference]: Without dead ends: 34 [2020-09-04 13:19:48,917 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:19:48,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-09-04 13:19:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-09-04 13:19:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 13:19:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-09-04 13:19:48,930 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-09-04 13:19:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:48,931 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-09-04 13:19:48,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:19:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-09-04 13:19:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:19:48,933 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:48,934 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:49,147 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-04 13:19:49,149 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:49,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-09-04 13:19:49,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:49,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737383054] [2020-09-04 13:19:49,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:19:49,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737383054] [2020-09-04 13:19:49,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913749678] [2020-09-04 13:19:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:19:49,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-09-04 13:19:49,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:49,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2020-09-04 13:19:49,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978101233] [2020-09-04 13:19:49,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:19:49,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:49,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:19:49,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:19:49,393 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 9 states. [2020-09-04 13:19:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:49,620 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-09-04 13:19:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 13:19:49,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-09-04 13:19:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:49,626 INFO L225 Difference]: With dead ends: 54 [2020-09-04 13:19:49,627 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 13:19:49,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:19:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 13:19:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-09-04 13:19:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-09-04 13:19:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-09-04 13:19:49,644 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-09-04 13:19:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:49,644 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-09-04 13:19:49,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:19:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-09-04 13:19:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-09-04 13:19:49,647 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:49,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:49,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:49,865 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-09-04 13:19:49,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:49,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749584105] [2020-09-04 13:19:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:49,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:19:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 13:19:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 13:19:50,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749584105] [2020-09-04 13:19:50,025 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137978342] [2020-09-04 13:19:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:19:50,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:19:50,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:50,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2020-09-04 13:19:50,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902934611] [2020-09-04 13:19:50,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 13:19:50,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:50,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 13:19:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-09-04 13:19:50,215 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 11 states. [2020-09-04 13:19:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:50,567 INFO L93 Difference]: Finished difference Result 108 states and 170 transitions. [2020-09-04 13:19:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 13:19:50,568 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2020-09-04 13:19:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:50,571 INFO L225 Difference]: With dead ends: 108 [2020-09-04 13:19:50,571 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 13:19:50,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:19:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 13:19:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-09-04 13:19:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-09-04 13:19:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2020-09-04 13:19:50,592 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 39 [2020-09-04 13:19:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:50,592 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2020-09-04 13:19:50,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 13:19:50,593 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2020-09-04 13:19:50,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 13:19:50,595 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:50,596 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:50,809 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:50,811 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:50,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-09-04 13:19:50,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:50,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855509875] [2020-09-04 13:19:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:50,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:51,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:51,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:51,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-09-04 13:19:51,118 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855509875] [2020-09-04 13:19:51,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418156684] [2020-09-04 13:19:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:51,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:19:51,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 13:19:51,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:51,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-09-04 13:19:51,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317732736] [2020-09-04 13:19:51,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 13:19:51,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:51,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 13:19:51,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:19:51,305 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand 13 states. [2020-09-04 13:19:51,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:51,875 INFO L93 Difference]: Finished difference Result 180 states and 324 transitions. [2020-09-04 13:19:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 13:19:51,876 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2020-09-04 13:19:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:51,881 INFO L225 Difference]: With dead ends: 180 [2020-09-04 13:19:51,881 INFO L226 Difference]: Without dead ends: 120 [2020-09-04 13:19:51,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2020-09-04 13:19:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-09-04 13:19:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106. [2020-09-04 13:19:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-09-04 13:19:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 169 transitions. [2020-09-04 13:19:51,929 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 169 transitions. Word has length 40 [2020-09-04 13:19:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:51,932 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 169 transitions. [2020-09-04 13:19:51,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 13:19:51,933 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 169 transitions. [2020-09-04 13:19:51,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 13:19:51,942 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:51,942 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:52,143 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:52,145 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:52,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:52,146 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-09-04 13:19:52,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:52,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828183998] [2020-09-04 13:19:52,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 13:19:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-09-04 13:19:52,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828183998] [2020-09-04 13:19:52,376 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329845014] [2020-09-04 13:19:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:52,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-04 13:19:52,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 13:19:52,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:52,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2020-09-04 13:19:52,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721281718] [2020-09-04 13:19:52,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 13:19:52,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 13:19:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-09-04 13:19:52,669 INFO L87 Difference]: Start difference. First operand 106 states and 169 transitions. Second operand 14 states. [2020-09-04 13:19:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:53,371 INFO L93 Difference]: Finished difference Result 258 states and 498 transitions. [2020-09-04 13:19:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 13:19:53,372 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2020-09-04 13:19:53,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:53,377 INFO L225 Difference]: With dead ends: 258 [2020-09-04 13:19:53,378 INFO L226 Difference]: Without dead ends: 158 [2020-09-04 13:19:53,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-09-04 13:19:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-09-04 13:19:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2020-09-04 13:19:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-09-04 13:19:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2020-09-04 13:19:53,421 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 54 [2020-09-04 13:19:53,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:53,421 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2020-09-04 13:19:53,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 13:19:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2020-09-04 13:19:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-09-04 13:19:53,426 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:53,427 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:53,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:19:53,629 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1504181040, now seen corresponding path program 1 times [2020-09-04 13:19:53,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:53,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210416272] [2020-09-04 13:19:53,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:19:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 13:19:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2020-09-04 13:19:53,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210416272] [2020-09-04 13:19:53,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918561789] [2020-09-04 13:19:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:54,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core [2020-09-04 13:19:54,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:54,187 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-09-04 13:19:54,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:54,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2020-09-04 13:19:54,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678216181] [2020-09-04 13:19:54,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 13:19:54,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 13:19:54,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-09-04 13:19:54,191 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand 16 states. [2020-09-04 13:19:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:54,990 INFO L93 Difference]: Finished difference Result 243 states and 465 transitions. [2020-09-04 13:19:54,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 13:19:54,991 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 82 [2020-09-04 13:19:54,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:54,994 INFO L225 Difference]: With dead ends: 243 [2020-09-04 13:19:54,994 INFO L226 Difference]: Without dead ends: 110 [2020-09-04 13:19:54,998 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2020-09-04 13:19:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-04 13:19:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 87. [2020-09-04 13:19:55,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-04 13:19:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2020-09-04 13:19:55,018 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 82 [2020-09-04 13:19:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:55,019 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2020-09-04 13:19:55,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 13:19:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2020-09-04 13:19:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 13:19:55,022 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:55,022 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:55,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:55,240 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash 2095197631, now seen corresponding path program 1 times [2020-09-04 13:19:55,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:55,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127696103] [2020-09-04 13:19:55,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:19:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 13:19:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2020-09-04 13:19:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,713 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 61 proven. 94 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2020-09-04 13:19:55,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127696103] [2020-09-04 13:19:55,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471136192] [2020-09-04 13:19:55,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:55,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-04 13:19:55,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2020-09-04 13:19:55,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:55,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-09-04 13:19:55,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766575394] [2020-09-04 13:19:55,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 13:19:55,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:55,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 13:19:55,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:19:55,960 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand 15 states. [2020-09-04 13:19:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:56,681 INFO L93 Difference]: Finished difference Result 172 states and 251 transitions. [2020-09-04 13:19:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 13:19:56,682 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-09-04 13:19:56,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:56,685 INFO L225 Difference]: With dead ends: 172 [2020-09-04 13:19:56,685 INFO L226 Difference]: Without dead ends: 96 [2020-09-04 13:19:56,687 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2020-09-04 13:19:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-09-04 13:19:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2020-09-04 13:19:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 13:19:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2020-09-04 13:19:56,703 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 123 [2020-09-04 13:19:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:56,703 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2020-09-04 13:19:56,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 13:19:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2020-09-04 13:19:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-09-04 13:19:56,706 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:56,706 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:56,921 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:56,923 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1830253150, now seen corresponding path program 2 times [2020-09-04 13:19:56,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:56,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338775284] [2020-09-04 13:19:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:56,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:56,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:19:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-09-04 13:19:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2020-09-04 13:19:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 110 proven. 86 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-09-04 13:19:57,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338775284] [2020-09-04 13:19:57,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770066004] [2020-09-04 13:19:57,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:57,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:19:57,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:19:57,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2020-09-04 13:19:57,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 78 proven. 108 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2020-09-04 13:19:57,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:57,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2020-09-04 13:19:57,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933920999] [2020-09-04 13:19:57,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 13:19:57,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:57,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 13:19:57,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2020-09-04 13:19:57,682 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 18 states. [2020-09-04 13:19:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:19:58,424 INFO L93 Difference]: Finished difference Result 204 states and 330 transitions. [2020-09-04 13:19:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 13:19:58,425 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 137 [2020-09-04 13:19:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:19:58,428 INFO L225 Difference]: With dead ends: 204 [2020-09-04 13:19:58,429 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 13:19:58,432 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2020-09-04 13:19:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 13:19:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-09-04 13:19:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 13:19:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2020-09-04 13:19:58,447 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 137 [2020-09-04 13:19:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:19:58,447 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2020-09-04 13:19:58,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 13:19:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2020-09-04 13:19:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-09-04 13:19:58,451 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:19:58,451 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:19:58,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-09-04 13:19:58,667 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:19:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:19:58,669 INFO L82 PathProgramCache]: Analyzing trace with hash -529934979, now seen corresponding path program 1 times [2020-09-04 13:19:58,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:19:58,670 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103391465] [2020-09-04 13:19:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:19:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:58,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:19:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:58,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:19:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:58,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:58,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:58,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:58,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:19:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:19:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:19:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:19:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:19:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:19:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 139 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2020-09-04 13:19:59,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103391465] [2020-09-04 13:19:59,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160772213] [2020-09-04 13:19:59,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:19:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:19:59,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 10 conjunts are in the unsatisfiable core [2020-09-04 13:19:59,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:19:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2020-09-04 13:19:59,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:19:59,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 17 [2020-09-04 13:19:59,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822535925] [2020-09-04 13:19:59,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 13:19:59,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:19:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 13:19:59,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-09-04 13:19:59,566 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 17 states. [2020-09-04 13:20:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:20:00,300 INFO L93 Difference]: Finished difference Result 202 states and 257 transitions. [2020-09-04 13:20:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 13:20:00,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2020-09-04 13:20:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:20:00,304 INFO L225 Difference]: With dead ends: 202 [2020-09-04 13:20:00,305 INFO L226 Difference]: Without dead ends: 114 [2020-09-04 13:20:00,307 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2020-09-04 13:20:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-09-04 13:20:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-09-04 13:20:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-09-04 13:20:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2020-09-04 13:20:00,319 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 150 [2020-09-04 13:20:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:20:00,320 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2020-09-04 13:20:00,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 13:20:00,320 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2020-09-04 13:20:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-09-04 13:20:00,323 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:20:00,323 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:20:00,537 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:20:00,538 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:20:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:20:00,540 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 2 times [2020-09-04 13:20:00,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:20:00,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411930523] [2020-09-04 13:20:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:20:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:20:00,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:20:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:20:00,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:20:00,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:20:00,680 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:20:00,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 13:20:00,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:20:00 BoogieIcfgContainer [2020-09-04 13:20:00,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:20:00,753 INFO L168 Benchmark]: Toolchain (without parser) took 14861.73 ms. Allocated memory was 138.9 MB in the beginning and 353.4 MB in the end (delta: 214.4 MB). Free memory was 99.6 MB in the beginning and 107.5 MB in the end (delta: -7.9 MB). Peak memory consumption was 206.6 MB. Max. memory is 7.1 GB. [2020-09-04 13:20:00,754 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 138.9 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:20:00,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.93 ms. Allocated memory is still 138.9 MB. Free memory was 99.4 MB in the beginning and 89.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-09-04 13:20:00,756 INFO L168 Benchmark]: Boogie Preprocessor took 183.92 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 89.7 MB in the beginning and 181.6 MB in the end (delta: -91.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2020-09-04 13:20:00,757 INFO L168 Benchmark]: RCFGBuilder took 405.82 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 168.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-04 13:20:00,758 INFO L168 Benchmark]: TraceAbstraction took 13901.40 ms. Allocated memory was 202.9 MB in the beginning and 353.4 MB in the end (delta: 150.5 MB). Free memory was 167.9 MB in the beginning and 107.5 MB in the end (delta: 60.4 MB). Peak memory consumption was 210.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:20:00,763 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.31 ms. Allocated memory is still 138.9 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 358.93 ms. Allocated memory is still 138.9 MB. Free memory was 99.4 MB in the beginning and 89.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.92 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 89.7 MB in the beginning and 181.6 MB in the end (delta: -91.8 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.82 ms. Allocated memory is still 202.9 MB. Free memory was 181.6 MB in the beginning and 168.5 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13901.40 ms. Allocated memory was 202.9 MB in the beginning and 353.4 MB in the end (delta: 150.5 MB). Free memory was 167.9 MB in the beginning and 107.5 MB in the end (delta: 60.4 MB). Peak memory consumption was 210.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 13, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 342 SDtfs, 494 SDslu, 2076 SDs, 0 SdLazy, 2900 SolverSat, 488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1080 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=7, 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, 11 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1560 NumberOfCodeBlocks, 1560 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1363 ConstructedInterpolants, 0 QuantifiedInterpolants, 218669 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1524 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 2424/3144 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...