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/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:15:26,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:26,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:27,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:27,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:27,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:27,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:27,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:27,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:27,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:27,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:27,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:27,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:27,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:27,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:27,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:27,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:27,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:27,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:27,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:27,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:27,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:27,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:27,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:27,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:27,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:27,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:27,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:27,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:27,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:27,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:27,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:27,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:27,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:27,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:27,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:27,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:27,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:27,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:27,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:27,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:27,060 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:15:27,081 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:27,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:27,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:27,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:27,085 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:27,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:27,085 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:27,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:27,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:27,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:27,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:27,087 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:27,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:27,087 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:27,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:27,088 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:27,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:27,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:27,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:27,088 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:27,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:27,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:27,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:27,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:27,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:27,089 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:27,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:27,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:27,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:27,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:27,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:27,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:27,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:27,449 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:27,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-14 23:15:27,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc79b00c6/b0bedded525448f6964e151da05862e6/FLAG9d4707739 [2019-10-14 23:15:28,003 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:28,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-10-14 23:15:28,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc79b00c6/b0bedded525448f6964e151da05862e6/FLAG9d4707739 [2019-10-14 23:15:28,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc79b00c6/b0bedded525448f6964e151da05862e6 [2019-10-14 23:15:28,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:28,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:28,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:28,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:28,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:28,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1568f796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28, skipping insertion in model container [2019-10-14 23:15:28,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,374 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:28,395 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:28,587 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:28,592 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:28,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:28,624 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:28,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28 WrapperNode [2019-10-14 23:15:28,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:28,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:28,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:28,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:28,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... [2019-10-14 23:15:28,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:28,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:28,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:28,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:28,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:15:28,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:28,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:29,035 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:29,036 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:15:29,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:29 BoogieIcfgContainer [2019-10-14 23:15:29,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:29,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:29,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:29,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:29,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:28" (1/3) ... [2019-10-14 23:15:29,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737ab5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:29, skipping insertion in model container [2019-10-14 23:15:29,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:28" (2/3) ... [2019-10-14 23:15:29,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737ab5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:29, skipping insertion in model container [2019-10-14 23:15:29,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:29" (3/3) ... [2019-10-14 23:15:29,048 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-10-14 23:15:29,063 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:29,074 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:15:29,090 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:15:29,126 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:29,127 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:29,127 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:29,127 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:29,127 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:29,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:29,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:29,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-10-14 23:15:29,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:15:29,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:29,158 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:29,160 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:29,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2019-10-14 23:15:29,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:29,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727437323] [2019-10-14 23:15:29,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:29,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:29,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:29,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727437323] [2019-10-14 23:15:29,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:29,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:29,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213497993] [2019-10-14 23:15:29,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:29,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:29,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:29,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:29,398 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-10-14 23:15:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:29,522 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2019-10-14 23:15:29,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:29,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 23:15:29,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:29,534 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:15:29,535 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 23:15:29,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 23:15:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-14 23:15:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-14 23:15:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-14 23:15:29,588 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-10-14 23:15:29,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:29,588 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-14 23:15:29,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-14 23:15:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:15:29,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:29,590 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:29,591 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2019-10-14 23:15:29,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:29,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847240182] [2019-10-14 23:15:29,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:29,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:29,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:29,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847240182] [2019-10-14 23:15:29,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:29,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:29,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877403304] [2019-10-14 23:15:29,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:29,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:29,679 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-10-14 23:15:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:29,856 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-14 23:15:29,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:29,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-14 23:15:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:29,859 INFO L225 Difference]: With dead ends: 40 [2019-10-14 23:15:29,859 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:15:29,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:15:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-10-14 23:15:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 23:15:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-10-14 23:15:29,870 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2019-10-14 23:15:29,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:29,871 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-10-14 23:15:29,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-10-14 23:15:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:15:29,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:29,872 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:29,872 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1063580357, now seen corresponding path program 1 times [2019-10-14 23:15:29,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:29,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701040491] [2019-10-14 23:15:29,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:29,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:29,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:29,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701040491] [2019-10-14 23:15:29,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:29,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:29,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020593950] [2019-10-14 23:15:29,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:29,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:29,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:29,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:29,965 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2019-10-14 23:15:30,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:30,033 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-10-14 23:15:30,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:30,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:15:30,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:30,035 INFO L225 Difference]: With dead ends: 45 [2019-10-14 23:15:30,036 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 23:15:30,036 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:30,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 23:15:30,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-14 23:15:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 23:15:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-10-14 23:15:30,048 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2019-10-14 23:15:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:30,049 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-10-14 23:15:30,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-10-14 23:15:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:15:30,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:30,051 INFO L380 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] [2019-10-14 23:15:30,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:30,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1462671860, now seen corresponding path program 1 times [2019-10-14 23:15:30,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:30,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2432443] [2019-10-14 23:15:30,052 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:30,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2432443] [2019-10-14 23:15:30,152 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:30,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:30,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765390957] [2019-10-14 23:15:30,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:30,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:30,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:30,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:30,154 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2019-10-14 23:15:30,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:30,312 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-10-14 23:15:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:30,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-10-14 23:15:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:30,315 INFO L225 Difference]: With dead ends: 68 [2019-10-14 23:15:30,315 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:15:30,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:15:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-10-14 23:15:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:15:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-10-14 23:15:30,329 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2019-10-14 23:15:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:30,329 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-10-14 23:15:30,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-10-14 23:15:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:15:30,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:30,332 INFO L380 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, 1] [2019-10-14 23:15:30,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:30,333 INFO L82 PathProgramCache]: Analyzing trace with hash -965699220, now seen corresponding path program 1 times [2019-10-14 23:15:30,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:30,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609079477] [2019-10-14 23:15:30,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,334 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:30,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609079477] [2019-10-14 23:15:30,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104684639] [2019-10-14 23:15:30,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 23:15:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:15:30,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 23:15:30,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:30,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-10-14 23:15:30,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089444809] [2019-10-14 23:15:30,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:30,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:30,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:30,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:15:30,620 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 5 states. [2019-10-14 23:15:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:30,777 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-10-14 23:15:30,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:15:30,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-10-14 23:15:30,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:30,779 INFO L225 Difference]: With dead ends: 115 [2019-10-14 23:15:30,779 INFO L226 Difference]: Without dead ends: 77 [2019-10-14 23:15:30,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:15:30,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-14 23:15:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 50. [2019-10-14 23:15:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-14 23:15:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-10-14 23:15:30,797 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2019-10-14 23:15:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:30,798 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-10-14 23:15:30,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-10-14 23:15:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:15:30,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:30,800 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:15:31,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:31,010 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:31,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1830678608, now seen corresponding path program 1 times [2019-10-14 23:15:31,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:31,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315856739] [2019-10-14 23:15:31,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:15:31,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315856739] [2019-10-14 23:15:31,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913891166] [2019-10-14 23:15:31,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 23:15:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:15:31,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:15:31,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:31,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-10-14 23:15:31,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526085086] [2019-10-14 23:15:31,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:15:31,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:15:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:15:31,168 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 9 states. [2019-10-14 23:15:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:31,351 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2019-10-14 23:15:31,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:15:31,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-14 23:15:31,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:31,354 INFO L225 Difference]: With dead ends: 97 [2019-10-14 23:15:31,354 INFO L226 Difference]: Without dead ends: 59 [2019-10-14 23:15:31,355 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:15:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-14 23:15:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-10-14 23:15:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:15:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-14 23:15:31,372 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2019-10-14 23:15:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:31,373 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-14 23:15:31,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:15:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-14 23:15:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:15:31,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:31,382 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:31,586 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:31,587 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:31,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:31,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1063418416, now seen corresponding path program 1 times [2019-10-14 23:15:31,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:31,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932618075] [2019-10-14 23:15:31,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:15:31,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932618075] [2019-10-14 23:15:31,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439274365] [2019-10-14 23:15:31,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 23:15:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:15:31,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:15:31,873 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:31,874 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-10-14 23:15:31,874 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085854563] [2019-10-14 23:15:31,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:15:31,883 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:15:31,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:31,885 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 14 states. [2019-10-14 23:15:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:32,196 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2019-10-14 23:15:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:15:32,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-10-14 23:15:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:32,198 INFO L225 Difference]: With dead ends: 120 [2019-10-14 23:15:32,200 INFO L226 Difference]: Without dead ends: 86 [2019-10-14 23:15:32,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:15:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-14 23:15:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2019-10-14 23:15:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-14 23:15:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-10-14 23:15:32,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2019-10-14 23:15:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:32,216 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-14 23:15:32,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:15:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-10-14 23:15:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:15:32,217 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:32,218 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:32,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:32,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:32,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:32,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1968312716, now seen corresponding path program 2 times [2019-10-14 23:15:32,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:32,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136657925] [2019-10-14 23:15:32,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:15:32,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136657925] [2019-10-14 23:15:32,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254442454] [2019-10-14 23:15:32,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 23:15:32,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:15:32,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:15:32,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:15:32,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:32,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-14 23:15:32,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:32,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-10-14 23:15:32,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93818023] [2019-10-14 23:15:32,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:32,631 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:15:32,632 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 6 states. [2019-10-14 23:15:32,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:32,709 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2019-10-14 23:15:32,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:32,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-14 23:15:32,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:32,711 INFO L225 Difference]: With dead ends: 71 [2019-10-14 23:15:32,711 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:15:32,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:15:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-14 23:15:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:15:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-10-14 23:15:32,721 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 38 [2019-10-14 23:15:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:32,722 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-10-14 23:15:32,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:32,722 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-10-14 23:15:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:15:32,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:32,723 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:32,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:32,927 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:32,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1032911483, now seen corresponding path program 1 times [2019-10-14 23:15:32,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:32,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458466274] [2019-10-14 23:15:32,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:15:33,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458466274] [2019-10-14 23:15:33,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294236869] [2019-10-14 23:15:33,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-10-14 23:15:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:15:33,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:15:33,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:15:33,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-10-14 23:15:33,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244639642] [2019-10-14 23:15:33,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:15:33,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:15:33,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:15:33,156 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 4 states. [2019-10-14 23:15:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:33,217 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-10-14 23:15:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:15:33,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-10-14 23:15:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:33,219 INFO L225 Difference]: With dead ends: 86 [2019-10-14 23:15:33,219 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:33,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:33,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-10-14 23:15:33,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:33,223 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:33,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:15:33,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:33,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:33,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:33,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:33,894 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:15:33,894 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:33,894 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:33,894 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:15:33,894 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:15:33,894 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:33,895 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-10-14 23:15:33,895 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-10-14 23:15:33,895 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-10-14 23:15:33,895 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))) [2019-10-14 23:15:33,895 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-10-14 23:15:33,895 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-10-14 23:15:33,896 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse3 (<= main_~n~0 main_~k~0))) (let ((.cse0 (and (<= main_~k~0 main_~n~0) .cse3)) (.cse1 (<= main_~n~0 main_~j~0))) (or (and .cse0 (<= main_~i~0 0)) (and .cse0 .cse1) (let ((.cse2 (div (+ (- main_~n~0) 1) (- 2)))) (and (<= .cse2 0) (<= (+ .cse2 1) main_~i~0) (<= main_~k~0 main_~i~0) .cse3 .cse1))))) [2019-10-14 23:15:33,896 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-10-14 23:15:33,896 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-10-14 23:15:33,896 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-10-14 23:15:33,896 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-10-14 23:15:33,896 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (let ((.cse1 (and (<= .cse0 main_~j~0) (<= main_~n~0 main_~k~0)))) (or (and (<= main_~k~0 (+ .cse0 1)) (<= main_~i~0 0) (and .cse1 (<= main_~k~0 main_~j~0))) (and (<= main_~k~0 main_~n~0) .cse1)))) [2019-10-14 23:15:33,897 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-10-14 23:15:33,897 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-10-14 23:15:33,897 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-10-14 23:15:33,897 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2019-10-14 23:15:33,897 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-10-14 23:15:33,897 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-14 23:15:33,898 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-14 23:15:33,898 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-14 23:15:33,898 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-14 23:15:33,898 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-14 23:15:33,898 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-14 23:15:33,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:33 BoogieIcfgContainer [2019-10-14 23:15:33,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:15:33,918 INFO L168 Benchmark]: Toolchain (without parser) took 5559.69 ms. Allocated memory was 137.9 MB in the beginning and 246.9 MB in the end (delta: 109.1 MB). Free memory was 103.3 MB in the beginning and 154.6 MB in the end (delta: -51.3 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:33,919 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-14 23:15:33,920 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.53 ms. Allocated memory is still 137.9 MB. Free memory was 103.0 MB in the beginning and 93.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:33,921 INFO L168 Benchmark]: Boogie Preprocessor took 107.27 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 93.1 MB in the beginning and 179.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:33,922 INFO L168 Benchmark]: RCFGBuilder took 304.43 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 165.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:33,923 INFO L168 Benchmark]: TraceAbstraction took 4876.80 ms. Allocated memory was 200.8 MB in the beginning and 246.9 MB in the end (delta: 46.1 MB). Free memory was 165.8 MB in the beginning and 154.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:33,927 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.53 ms. Allocated memory is still 137.9 MB. Free memory was 103.0 MB in the beginning and 93.1 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.27 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 93.1 MB in the beginning and 179.2 MB in the end (delta: -86.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 304.43 ms. Allocated memory is still 200.8 MB. Free memory was 179.2 MB in the beginning and 165.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4876.80 ms. Allocated memory was 200.8 MB in the beginning and 246.9 MB in the end (delta: 46.1 MB). Free memory was 165.8 MB in the beginning and 154.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 117.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((k <= 2 * i + 1 && i <= 0) && (2 * i <= j && n <= k) && k <= j) || (k <= n && 2 * i <= j && n <= k) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((j < n && 2 * i <= j) && 2 * i <= k) && k <= n - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((k <= n && n <= k) && i <= 0) || ((k <= n && n <= k) && n <= j)) || (((((-n + 1) / -2 <= 0 && (-n + 1) / -2 + 1 <= i) && k <= i) && n <= k) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 252 SDtfs, 120 SDslu, 799 SDs, 0 SdLazy, 577 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 100 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 39 PreInvPairs, 58 NumberOfFragments, 164 HoareAnnotationTreeSize, 39 FomulaSimplifications, 4205 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1104 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 401 ConstructedInterpolants, 1 QuantifiedInterpolants, 29706 SizeOfPredicates, 16 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 149/182 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...