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/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:50:08,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:50:08,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:50:09,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:50:09,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:50:09,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:50:09,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:50:09,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:50:09,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:50:09,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:50:09,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:50:09,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:50:09,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:50:09,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:50:09,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:50:09,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:50:09,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:50:09,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:50:09,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:50:09,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:50:09,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:50:09,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:50:09,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:50:09,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:50:09,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:50:09,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:50:09,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:50:09,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:50:09,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:50:09,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:50:09,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:50:09,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:50:09,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:50:09,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:50:09,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:50:09,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:50:09,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:50:09,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:50:09,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:50:09,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:50:09,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:50:09,068 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-09-03 19:50:09,094 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:50:09,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:50:09,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:50:09,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:50:09,098 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:50:09,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:50:09,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:50:09,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:50:09,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:50:09,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:50:09,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:50:09,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:50:09,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:50:09,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:50:09,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:50:09,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:50:09,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:50:09,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:50:09,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:50:09,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:50:09,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:50:09,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:50:09,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:50:09,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:50:09,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:50:09,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:50:09,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:50:09,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:50:09,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:50:09,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:50:09,154 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:50:09,158 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:50:09,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:50:09,162 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:50:09,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-03 19:50:09,236 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa104bbe/a79027221df2434b9d3f57801cc3ee50/FLAG5fda46e04 [2019-09-03 19:50:09,714 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:50:09,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-03 19:50:09,721 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa104bbe/a79027221df2434b9d3f57801cc3ee50/FLAG5fda46e04 [2019-09-03 19:50:10,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa104bbe/a79027221df2434b9d3f57801cc3ee50 [2019-09-03 19:50:10,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:50:10,090 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:50:10,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:10,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:50:10,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:50:10,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436a110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10, skipping insertion in model container [2019-09-03 19:50:10,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,106 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:50:10,124 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:50:10,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:10,309 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:50:10,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:50:10,344 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:50:10,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10 WrapperNode [2019-09-03 19:50:10,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:50:10,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:50:10,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:50:10,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:50:10,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (1/1) ... [2019-09-03 19:50:10,464 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:50:10,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:50:10,465 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:50:10,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:50:10,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (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-09-03 19:50:10,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:50:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:50:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:50:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:50:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:50:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 19:50:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:50:10,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 19:50:10,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:50:10,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:50:10,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:50:10,807 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:50:10,820 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 19:50:10,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:10 BoogieIcfgContainer [2019-09-03 19:50:10,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:50:10,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:50:10,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:50:10,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:50:10,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:50:10" (1/3) ... [2019-09-03 19:50:10,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8794d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:10, skipping insertion in model container [2019-09-03 19:50:10,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:50:10" (2/3) ... [2019-09-03 19:50:10,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8794d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:50:10, skipping insertion in model container [2019-09-03 19:50:10,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:50:10" (3/3) ... [2019-09-03 19:50:10,836 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-09-03 19:50:10,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:50:10,853 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:50:10,867 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:50:10,898 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:50:10,899 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:50:10,899 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:50:10,899 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:50:10,900 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:50:10,900 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:50:10,900 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:50:10,900 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:50:10,900 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:50:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-09-03 19:50:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:50:10,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:10,925 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:10,928 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:10,933 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-09-03 19:50:10,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:10,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:10,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:11,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:11,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:50:11,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:50:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:50:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:50:11,151 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-09-03 19:50:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:11,298 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2019-09-03 19:50:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:50:11,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 19:50:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:11,312 INFO L225 Difference]: With dead ends: 83 [2019-09-03 19:50:11,313 INFO L226 Difference]: Without dead ends: 42 [2019-09-03 19:50:11,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-03 19:50:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-03 19:50:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-03 19:50:11,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-03 19:50:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-09-03 19:50:11,367 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-09-03 19:50:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:11,368 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-09-03 19:50:11,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:50:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-09-03 19:50:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:50:11,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:11,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:11,370 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-09-03 19:50:11,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:11,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:11,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:11,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:11,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:50:11,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:50:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:50:11,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:50:11,453 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-09-03 19:50:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:11,560 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2019-09-03 19:50:11,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:50:11,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-03 19:50:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:11,562 INFO L225 Difference]: With dead ends: 49 [2019-09-03 19:50:11,562 INFO L226 Difference]: Without dead ends: 47 [2019-09-03 19:50:11,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-03 19:50:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-03 19:50:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-03 19:50:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-03 19:50:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-09-03 19:50:11,576 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-09-03 19:50:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:11,577 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-09-03 19:50:11,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:50:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-09-03 19:50:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:50:11,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:11,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:11,579 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:11,579 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-09-03 19:50:11,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:11,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:11,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:11,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:11,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:11,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:11,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:11,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:11,655 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-09-03 19:50:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:11,897 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2019-09-03 19:50:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:11,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-03 19:50:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:11,900 INFO L225 Difference]: With dead ends: 79 [2019-09-03 19:50:11,900 INFO L226 Difference]: Without dead ends: 77 [2019-09-03 19:50:11,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-03 19:50:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-03 19:50:11,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-09-03 19:50:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 19:50:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-09-03 19:50:11,919 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-09-03 19:50:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:11,920 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-09-03 19:50:11,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-09-03 19:50:11,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:50:11,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:11,921 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:11,922 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-09-03 19:50:11,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:11,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:11,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:11,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:12,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:12,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:12,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:12,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:12,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:12,025 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-09-03 19:50:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:12,287 INFO L93 Difference]: Finished difference Result 105 states and 156 transitions. [2019-09-03 19:50:12,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:12,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-03 19:50:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:12,289 INFO L225 Difference]: With dead ends: 105 [2019-09-03 19:50:12,290 INFO L226 Difference]: Without dead ends: 103 [2019-09-03 19:50:12,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-09-03 19:50:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-03 19:50:12,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-09-03 19:50:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-03 19:50:12,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-09-03 19:50:12,317 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-09-03 19:50:12,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:12,318 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-09-03 19:50:12,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:12,318 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-09-03 19:50:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:50:12,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:12,321 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:12,322 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:12,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-09-03 19:50:12,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:12,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:12,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:12,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:50:12,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:50:12,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:50:12,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:50:12,381 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-09-03 19:50:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:12,454 INFO L93 Difference]: Finished difference Result 106 states and 156 transitions. [2019-09-03 19:50:12,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:50:12,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-03 19:50:12,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:12,458 INFO L225 Difference]: With dead ends: 106 [2019-09-03 19:50:12,458 INFO L226 Difference]: Without dead ends: 104 [2019-09-03 19:50:12,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-03 19:50:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-03 19:50:12,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-03 19:50:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-03 19:50:12,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-03 19:50:12,479 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-09-03 19:50:12,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:12,479 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-03 19:50:12,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:50:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-03 19:50:12,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:50:12,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:12,481 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:12,481 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-09-03 19:50:12,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:12,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:12,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:12,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:12,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:12,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:12,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:12,540 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-09-03 19:50:12,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:12,756 INFO L93 Difference]: Finished difference Result 157 states and 240 transitions. [2019-09-03 19:50:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:50:12,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-03 19:50:12,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:12,759 INFO L225 Difference]: With dead ends: 157 [2019-09-03 19:50:12,760 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 19:50:12,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-03 19:50:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 19:50:12,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-09-03 19:50:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-03 19:50:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-09-03 19:50:12,809 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-09-03 19:50:12,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:12,812 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-09-03 19:50:12,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:12,812 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-09-03 19:50:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:50:12,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:12,814 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:12,814 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-09-03 19:50:12,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:12,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:12,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:12,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:12,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:12,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:12,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:12,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:12,901 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-09-03 19:50:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:13,107 INFO L93 Difference]: Finished difference Result 189 states and 291 transitions. [2019-09-03 19:50:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:50:13,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-03 19:50:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:13,111 INFO L225 Difference]: With dead ends: 189 [2019-09-03 19:50:13,111 INFO L226 Difference]: Without dead ends: 187 [2019-09-03 19:50:13,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-03 19:50:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-03 19:50:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-09-03 19:50:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-03 19:50:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-09-03 19:50:13,142 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-09-03 19:50:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:13,143 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-09-03 19:50:13,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-09-03 19:50:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 19:50:13,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:13,145 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:13,145 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-09-03 19:50:13,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:13,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:13,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:50:13,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:13,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:50:13,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:50:13,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:50:13,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:50:13,181 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-09-03 19:50:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:13,219 INFO L93 Difference]: Finished difference Result 309 states and 481 transitions. [2019-09-03 19:50:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:50:13,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-03 19:50:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:13,223 INFO L225 Difference]: With dead ends: 309 [2019-09-03 19:50:13,223 INFO L226 Difference]: Without dead ends: 232 [2019-09-03 19:50:13,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:50:13,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-03 19:50:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-09-03 19:50:13,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-03 19:50:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-09-03 19:50:13,265 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-09-03 19:50:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:13,267 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-09-03 19:50:13,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:50:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-09-03 19:50:13,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 19:50:13,270 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:13,270 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:13,270 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:13,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:13,271 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-09-03 19:50:13,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:13,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:50:13,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:13,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:13,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:13,361 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-09-03 19:50:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:13,533 INFO L93 Difference]: Finished difference Result 334 states and 545 transitions. [2019-09-03 19:50:13,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:13,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-03 19:50:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:13,537 INFO L225 Difference]: With dead ends: 334 [2019-09-03 19:50:13,537 INFO L226 Difference]: Without dead ends: 332 [2019-09-03 19:50:13,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-03 19:50:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-09-03 19:50:13,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 226. [2019-09-03 19:50:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 19:50:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 361 transitions. [2019-09-03 19:50:13,568 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 361 transitions. Word has length 26 [2019-09-03 19:50:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:13,569 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 361 transitions. [2019-09-03 19:50:13,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 361 transitions. [2019-09-03 19:50:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 19:50:13,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:13,570 INFO L399 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] [2019-09-03 19:50:13,570 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:13,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:13,571 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-09-03 19:50:13,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:13,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 19:50:13,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:13,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 19:50:13,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:50:13,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:50:13,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:50:13,619 INFO L87 Difference]: Start difference. First operand 226 states and 361 transitions. Second operand 5 states. [2019-09-03 19:50:13,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:13,868 INFO L93 Difference]: Finished difference Result 534 states and 861 transitions. [2019-09-03 19:50:13,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:50:13,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-09-03 19:50:13,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:13,874 INFO L225 Difference]: With dead ends: 534 [2019-09-03 19:50:13,875 INFO L226 Difference]: Without dead ends: 356 [2019-09-03 19:50:13,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:13,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-03 19:50:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 226. [2019-09-03 19:50:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-03 19:50:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 359 transitions. [2019-09-03 19:50:13,914 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 359 transitions. Word has length 28 [2019-09-03 19:50:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:13,914 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 359 transitions. [2019-09-03 19:50:13,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:50:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 359 transitions. [2019-09-03 19:50:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 19:50:13,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:13,923 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:13,931 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:13,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:13,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-09-03 19:50:13,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:13,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:13,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:14,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 19:50:14,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:14,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:14,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:14,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:14,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:14,001 INFO L87 Difference]: Start difference. First operand 226 states and 359 transitions. Second operand 7 states. [2019-09-03 19:50:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:14,250 INFO L93 Difference]: Finished difference Result 362 states and 594 transitions. [2019-09-03 19:50:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:14,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-03 19:50:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:14,254 INFO L225 Difference]: With dead ends: 362 [2019-09-03 19:50:14,254 INFO L226 Difference]: Without dead ends: 360 [2019-09-03 19:50:14,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-03 19:50:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 306. [2019-09-03 19:50:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-03 19:50:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2019-09-03 19:50:14,295 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 31 [2019-09-03 19:50:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:14,295 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2019-09-03 19:50:14,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2019-09-03 19:50:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:50:14,297 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:14,297 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:14,297 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:14,297 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-09-03 19:50:14,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:14,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 19:50:14,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:14,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:14,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:14,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:14,359 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand 7 states. [2019-09-03 19:50:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:14,578 INFO L93 Difference]: Finished difference Result 348 states and 559 transitions. [2019-09-03 19:50:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:14,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-03 19:50:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:14,583 INFO L225 Difference]: With dead ends: 348 [2019-09-03 19:50:14,583 INFO L226 Difference]: Without dead ends: 346 [2019-09-03 19:50:14,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-03 19:50:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2019-09-03 19:50:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-03 19:50:14,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 505 transitions. [2019-09-03 19:50:14,627 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 505 transitions. Word has length 41 [2019-09-03 19:50:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:14,629 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 505 transitions. [2019-09-03 19:50:14,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 505 transitions. [2019-09-03 19:50:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 19:50:14,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:14,632 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2019-09-03 19:50:14,633 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1384233346, now seen corresponding path program 1 times [2019-09-03 19:50:14,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 19:50:14,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:14,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:14,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:14,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:14,728 INFO L87 Difference]: Start difference. First operand 310 states and 505 transitions. Second operand 7 states. [2019-09-03 19:50:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:14,886 INFO L93 Difference]: Finished difference Result 317 states and 511 transitions. [2019-09-03 19:50:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:14,887 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-03 19:50:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:14,891 INFO L225 Difference]: With dead ends: 317 [2019-09-03 19:50:14,891 INFO L226 Difference]: Without dead ends: 315 [2019-09-03 19:50:14,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-03 19:50:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 185. [2019-09-03 19:50:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-09-03 19:50:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 278 transitions. [2019-09-03 19:50:14,919 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 278 transitions. Word has length 41 [2019-09-03 19:50:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:14,920 INFO L475 AbstractCegarLoop]: Abstraction has 185 states and 278 transitions. [2019-09-03 19:50:14,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2019-09-03 19:50:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-03 19:50:14,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:14,921 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:14,922 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:14,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:14,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1052669362, now seen corresponding path program 1 times [2019-09-03 19:50:14,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:14,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:14,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:14,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 19:50:15,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:15,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 19:50:15,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:50:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:50:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:50:15,012 INFO L87 Difference]: Start difference. First operand 185 states and 278 transitions. Second operand 6 states. [2019-09-03 19:50:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:15,192 INFO L93 Difference]: Finished difference Result 344 states and 554 transitions. [2019-09-03 19:50:15,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:50:15,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-09-03 19:50:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:15,198 INFO L225 Difference]: With dead ends: 344 [2019-09-03 19:50:15,198 INFO L226 Difference]: Without dead ends: 342 [2019-09-03 19:50:15,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-03 19:50:15,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-03 19:50:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 318. [2019-09-03 19:50:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-03 19:50:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 511 transitions. [2019-09-03 19:50:15,249 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 511 transitions. Word has length 48 [2019-09-03 19:50:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:15,249 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 511 transitions. [2019-09-03 19:50:15,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:50:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 511 transitions. [2019-09-03 19:50:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-03 19:50:15,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:15,251 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 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] [2019-09-03 19:50:15,251 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:15,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:15,252 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-09-03 19:50:15,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:15,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:15,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:15,329 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-03 19:50:15,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:15,329 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:15,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:15,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-03 19:50:15,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-03 19:50:15,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-03 19:50:15,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-09-03 19:50:15,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:50:15,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:50:15,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:50:15,494 INFO L87 Difference]: Start difference. First operand 318 states and 511 transitions. Second operand 9 states. [2019-09-03 19:50:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:16,163 INFO L93 Difference]: Finished difference Result 675 states and 1074 transitions. [2019-09-03 19:50:16,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 19:50:16,165 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-09-03 19:50:16,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:16,168 INFO L225 Difference]: With dead ends: 675 [2019-09-03 19:50:16,168 INFO L226 Difference]: Without dead ends: 391 [2019-09-03 19:50:16,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-03 19:50:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-09-03 19:50:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 330. [2019-09-03 19:50:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-03 19:50:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 521 transitions. [2019-09-03 19:50:16,249 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 521 transitions. Word has length 61 [2019-09-03 19:50:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:16,250 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 521 transitions. [2019-09-03 19:50:16,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:50:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 521 transitions. [2019-09-03 19:50:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-03 19:50:16,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:16,253 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:16,253 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:16,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2141038378, now seen corresponding path program 1 times [2019-09-03 19:50:16,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:16,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:16,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:16,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-03 19:50:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:50:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-03 19:50:16,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:50:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:50:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:50:16,333 INFO L87 Difference]: Start difference. First operand 330 states and 521 transitions. Second operand 7 states. [2019-09-03 19:50:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:16,536 INFO L93 Difference]: Finished difference Result 382 states and 604 transitions. [2019-09-03 19:50:16,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:50:16,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-09-03 19:50:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:16,540 INFO L225 Difference]: With dead ends: 382 [2019-09-03 19:50:16,540 INFO L226 Difference]: Without dead ends: 380 [2019-09-03 19:50:16,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:50:16,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-03 19:50:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 334. [2019-09-03 19:50:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-03 19:50:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 524 transitions. [2019-09-03 19:50:16,583 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 524 transitions. Word has length 75 [2019-09-03 19:50:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:16,584 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 524 transitions. [2019-09-03 19:50:16,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:50:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 524 transitions. [2019-09-03 19:50:16,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:50:16,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:16,586 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:16,586 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:16,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:16,587 INFO L82 PathProgramCache]: Analyzing trace with hash 2023812105, now seen corresponding path program 1 times [2019-09-03 19:50:16,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:16,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:16,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:16,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2019-09-03 19:50:16,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:16,657 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:16,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:16,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 19:50:16,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:16,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-03 19:50:17,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:17,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-09-03 19:50:17,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-03 19:50:17,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-03 19:50:17,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-03 19:50:17,021 INFO L87 Difference]: Start difference. First operand 334 states and 524 transitions. Second operand 15 states. [2019-09-03 19:50:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:18,924 INFO L93 Difference]: Finished difference Result 482 states and 764 transitions. [2019-09-03 19:50:18,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:50:18,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2019-09-03 19:50:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:18,928 INFO L225 Difference]: With dead ends: 482 [2019-09-03 19:50:18,929 INFO L226 Difference]: Without dead ends: 347 [2019-09-03 19:50:18,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=709, Unknown=0, NotChecked=0, Total=930 [2019-09-03 19:50:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-09-03 19:50:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 259. [2019-09-03 19:50:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-03 19:50:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 386 transitions. [2019-09-03 19:50:18,971 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 386 transitions. Word has length 88 [2019-09-03 19:50:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:18,971 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 386 transitions. [2019-09-03 19:50:18,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-03 19:50:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-09-03 19:50:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-03 19:50:18,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:18,973 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 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] [2019-09-03 19:50:18,973 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -389727920, now seen corresponding path program 1 times [2019-09-03 19:50:18,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:18,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:18,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-09-03 19:50:19,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:19,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:19,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:50:19,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-03 19:50:19,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:19,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-09-03 19:50:19,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 19:50:19,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 19:50:19,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-03 19:50:19,155 INFO L87 Difference]: Start difference. First operand 259 states and 386 transitions. Second operand 11 states. [2019-09-03 19:50:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:20,335 INFO L93 Difference]: Finished difference Result 596 states and 909 transitions. [2019-09-03 19:50:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-03 19:50:20,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-09-03 19:50:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:20,339 INFO L225 Difference]: With dead ends: 596 [2019-09-03 19:50:20,339 INFO L226 Difference]: Without dead ends: 420 [2019-09-03 19:50:20,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2019-09-03 19:50:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-09-03 19:50:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 326. [2019-09-03 19:50:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-03 19:50:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 495 transitions. [2019-09-03 19:50:20,411 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 495 transitions. Word has length 88 [2019-09-03 19:50:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:20,412 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 495 transitions. [2019-09-03 19:50:20,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 19:50:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 495 transitions. [2019-09-03 19:50:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:50:20,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:20,415 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:20,415 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash -16221646, now seen corresponding path program 1 times [2019-09-03 19:50:20,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:20,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:20,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:20,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:20,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:20,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:20,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 19:50:20,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-09-03 19:50:20,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:20,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-09-03 19:50:20,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:50:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:50:20,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:50:20,790 INFO L87 Difference]: Start difference. First operand 326 states and 495 transitions. Second operand 14 states. [2019-09-03 19:50:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:22,214 INFO L93 Difference]: Finished difference Result 894 states and 1414 transitions. [2019-09-03 19:50:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-03 19:50:22,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-03 19:50:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:22,219 INFO L225 Difference]: With dead ends: 894 [2019-09-03 19:50:22,219 INFO L226 Difference]: Without dead ends: 502 [2019-09-03 19:50:22,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2019-09-03 19:50:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-09-03 19:50:22,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 448. [2019-09-03 19:50:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-09-03 19:50:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 711 transitions. [2019-09-03 19:50:22,324 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 711 transitions. Word has length 110 [2019-09-03 19:50:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:22,324 INFO L475 AbstractCegarLoop]: Abstraction has 448 states and 711 transitions. [2019-09-03 19:50:22,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:50:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 711 transitions. [2019-09-03 19:50:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-03 19:50:22,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:50:22,327 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:50:22,327 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:50:22,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:50:22,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1522118384, now seen corresponding path program 1 times [2019-09-03 19:50:22,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:50:22,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:50:22,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:22,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:50:22,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:50:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:22,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:50:22,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:50:22,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:50:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:50:22,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 19:50:22,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:50:22,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:50:22,596 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-03 19:50:22,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:50:22,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-03 19:50:22,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 19:50:22,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 19:50:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-03 19:50:22,608 INFO L87 Difference]: Start difference. First operand 448 states and 711 transitions. Second operand 14 states. [2019-09-03 19:50:23,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:50:23,951 INFO L93 Difference]: Finished difference Result 549 states and 871 transitions. [2019-09-03 19:50:23,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 19:50:23,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 110 [2019-09-03 19:50:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:50:23,952 INFO L225 Difference]: With dead ends: 549 [2019-09-03 19:50:23,952 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:50:23,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 113 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-09-03 19:50:23,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:50:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:50:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:50:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:50:23,958 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 110 [2019-09-03 19:50:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:50:23,958 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:50:23,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 19:50:23,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:50:23,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:50:23,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:50:24,080 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 129 [2019-09-03 19:50:24,409 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 146 [2019-09-03 19:50:24,678 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2019-09-03 19:50:24,934 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 146 [2019-09-03 19:50:25,236 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 144 [2019-09-03 19:50:25,339 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-09-03 19:50:25,969 WARN L188 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 268 DAG size of output: 202 [2019-09-03 19:50:26,129 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-09-03 19:50:26,484 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 146 [2019-09-03 19:50:27,219 WARN L188 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 187 [2019-09-03 19:50:27,360 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 112 [2019-09-03 19:50:27,961 WARN L188 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 239 [2019-09-03 19:50:28,438 WARN L188 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 187 [2019-09-03 19:50:28,865 WARN L188 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 239 [2019-09-03 19:50:29,717 WARN L188 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 46 [2019-09-03 19:50:30,071 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-03 19:50:30,797 WARN L188 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 20 [2019-09-03 19:50:31,185 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-03 19:50:31,869 WARN L188 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 20 [2019-09-03 19:50:32,316 WARN L188 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-03 19:50:32,732 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-03 19:50:33,645 WARN L188 SmtUtils]: Spent 910.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 33 [2019-09-03 19:50:34,069 WARN L188 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-03 19:50:34,422 WARN L188 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 22 [2019-09-03 19:50:35,413 WARN L188 SmtUtils]: Spent 989.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 21 [2019-09-03 19:50:35,904 WARN L188 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 33 [2019-09-03 19:50:37,221 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 219 DAG size of output: 22 [2019-09-03 19:50:38,221 WARN L188 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 21 [2019-09-03 19:50:39,478 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 219 DAG size of output: 22 [2019-09-03 19:50:39,515 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:50:39,515 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:39,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:50:39,516 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:50:39,516 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:50:39,516 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:50:39,516 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-03 19:50:39,516 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 56) no Hoare annotation was computed. [2019-09-03 19:50:39,517 INFO L439 ceAbstractionStarter]: At program point L40(line 40) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,517 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-03 19:50:39,517 INFO L439 ceAbstractionStarter]: At program point L24-2(lines 24 44) the Hoare annotation is: (let ((.cse2 (<= 1 main_~l~0)) (.cse4 (<= main_~r~0 main_~n~0)) (.cse11 (* 2 main_~i~0)) (.cse10 (* 2 main_~l~0))) (let ((.cse0 (<= 2 main_~i~0)) (.cse5 (<= .cse10 main_~j~0)) (.cse8 (div main_~j~0 2)) (.cse1 (<= .cse10 main_~r~0)) (.cse9 (<= 1 main_~i~0)) (.cse3 (<= (+ .cse11 main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse6 (+ .cse11 main_~r~0)) (.cse7 (and (<= 2 main_~j~0) .cse2 (<= main_~l~0 1) .cse4 (<= 2 main_~r~0)))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) (<= (div (- main_~r~0) (- 2)) (+ main_~l~0 1)) .cse5) (and .cse0 .cse2 .cse3 .cse5 .cse1 .cse4 (<= (+ main_~j~0 4) .cse6)) (and .cse0 .cse7 (<= main_~i~0 .cse8)) (and .cse3 .cse5 (<= 1 .cse8) .cse1 .cse9 .cse4 (<= main_~j~0 .cse10)) (and .cse9 .cse3 (and (<= (+ main_~j~0 2) .cse6) .cse7))))) [2019-09-03 19:50:39,517 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 21 54) no Hoare annotation was computed. [2019-09-03 19:50:39,517 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-09-03 19:50:39,517 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 10 56) no Hoare annotation was computed. [2019-09-03 19:50:39,518 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-09-03 19:50:39,518 INFO L439 ceAbstractionStarter]: At program point L33(line 33) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,518 INFO L443 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2019-09-03 19:50:39,518 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 32) no Hoare annotation was computed. [2019-09-03 19:50:39,518 INFO L439 ceAbstractionStarter]: At program point L25-1(lines 25 32) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,518 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 21 54) no Hoare annotation was computed. [2019-09-03 19:50:39,518 INFO L439 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2019-09-03 19:50:39,519 INFO L439 ceAbstractionStarter]: At program point L50-1(line 50) the Hoare annotation is: (and (<= 2 main_~j~0) (<= 1 main_~l~0) (<= main_~l~0 1) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~r~0)) [2019-09-03 19:50:39,519 INFO L439 ceAbstractionStarter]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= .cse0 main_~r~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,519 INFO L443 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2019-09-03 19:50:39,519 INFO L439 ceAbstractionStarter]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= .cse0 main_~r~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= 2 main_~l~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,519 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 56) no Hoare annotation was computed. [2019-09-03 19:50:39,519 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= 1 main_~i~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,520 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse6 (* 2 main_~l~0))) (let ((.cse4 (<= .cse6 main_~j~0)) (.cse0 (<= (+ main_~i~0 1) main_~n~0)) (.cse1 (<= 1 main_~l~0)) (.cse2 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse5 (<= main_~r~0 main_~n~0)) (.cse3 (<= main_~j~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~l~0 1) (div main_~r~0 2)) .cse5) (and (and .cse0 (<= .cse6 main_~r~0) .cse1 (<= 1 main_~i~0) .cse2 .cse5 .cse3) .cse4) (and (and (<= 2 main_~j~0) (<= main_~l~0 1) (<= 2 main_~r~0)) .cse0 .cse1 .cse2 .cse5 .cse3)))) [2019-09-03 19:50:39,520 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-09-03 19:50:39,520 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-03 19:50:39,520 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 56) the Hoare annotation is: true [2019-09-03 19:50:39,520 INFO L439 ceAbstractionStarter]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-03 19:50:39,520 INFO L439 ceAbstractionStarter]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse3 (* 2 main_~l~0))) (let ((.cse4 (<= 1 main_~i~0)) (.cse7 (<= 1 main_~l~0)) (.cse6 (<= main_~j~0 main_~r~0)) (.cse0 (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0)))) (.cse1 (<= (+ main_~j~0 1) main_~n~0)) (.cse2 (<= .cse3 main_~j~0)) (.cse5 (<= main_~r~0 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= 1 (div main_~j~0 2)) (<= .cse3 main_~r~0) .cse4 .cse5 (<= main_~j~0 .cse3)) (and .cse4 .cse1 .cse0 .cse5 (and .cse6 (and (<= 2 main_~j~0) .cse7 (<= main_~l~0 1)))) (and (<= 2 main_~i~0) .cse7 .cse6 .cse0 .cse1 .cse2 .cse5)))) [2019-09-03 19:50:39,521 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-03 19:50:39,521 INFO L443 ceAbstractionStarter]: For program point L47(line 47) no Hoare annotation was computed. [2019-09-03 19:50:39,521 INFO L439 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (* 2 main_~l~0))) (and (<= (+ main_~i~0 1) main_~n~0) (<= .cse0 main_~r~0) (<= 1 main_~l~0) (<= (+ (* 2 main_~i~0) main_~r~0 2) (+ main_~j~0 (* 2 main_~n~0))) (<= main_~r~0 main_~n~0) (<= main_~j~0 main_~n~0) (<= .cse0 main_~j~0))) [2019-09-03 19:50:39,521 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-09-03 19:50:39,521 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:50:39,521 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:50:39,521 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:50:39,521 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:50:39,522 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:50:39,522 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:50:39,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:50:39 BoogieIcfgContainer [2019-09-03 19:50:39,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:50:39,542 INFO L168 Benchmark]: Toolchain (without parser) took 29451.73 ms. Allocated memory was 133.2 MB in the beginning and 554.7 MB in the end (delta: 421.5 MB). Free memory was 86.1 MB in the beginning and 208.1 MB in the end (delta: -122.0 MB). Peak memory consumption was 438.9 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:39,542 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 133.2 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-03 19:50:39,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.12 ms. Allocated memory is still 133.2 MB. Free memory was 85.7 MB in the beginning and 76.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:39,544 INFO L168 Benchmark]: Boogie Preprocessor took 119.06 ms. Allocated memory was 133.2 MB in the beginning and 198.2 MB in the end (delta: 65.0 MB). Free memory was 76.0 MB in the beginning and 175.6 MB in the end (delta: -99.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:39,544 INFO L168 Benchmark]: RCFGBuilder took 357.41 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 160.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:39,545 INFO L168 Benchmark]: TraceAbstraction took 28716.97 ms. Allocated memory was 198.2 MB in the beginning and 554.7 MB in the end (delta: 356.5 MB). Free memory was 159.4 MB in the beginning and 208.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 447.2 MB. Max. memory is 7.1 GB. [2019-09-03 19:50:39,548 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.46 ms. Allocated memory is still 133.2 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 254.12 ms. Allocated memory is still 133.2 MB. Free memory was 85.7 MB in the beginning and 76.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 119.06 ms. Allocated memory was 133.2 MB in the beginning and 198.2 MB in the end (delta: 65.0 MB). Free memory was 76.0 MB in the beginning and 175.6 MB in the end (delta: -99.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 357.41 ms. Allocated memory is still 198.2 MB. Free memory was 175.6 MB in the beginning and 160.1 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28716.97 ms. Allocated memory was 198.2 MB in the beginning and 554.7 MB in the end (delta: 356.5 MB). Free memory was 159.4 MB in the beginning and 208.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 447.2 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: 24]: Loop Invariant Derived loop invariant: (((((((((2 <= i && 2 * l <= r) && 1 <= l) && 2 * i + r + 2 <= j + 2 * n) && r <= n) && -r / -2 <= l + 1) && 2 * l <= j) || ((((((2 <= i && 1 <= l) && 2 * i + r + 2 <= j + 2 * n) && 2 * l <= j) && 2 * l <= r) && r <= n) && j + 4 <= 2 * i + r)) || ((2 <= i && (((2 <= j && 1 <= l) && l <= 1) && r <= n) && 2 <= r) && i <= j / 2)) || ((((((2 * i + r + 2 <= j + 2 * n && 2 * l <= j) && 1 <= j / 2) && 2 * l <= r) && 1 <= i) && r <= n) && j <= 2 * l)) || ((1 <= i && 2 * i + r + 2 <= j + 2 * n) && j + 2 <= 2 * i + r && (((2 <= j && 1 <= l) && l <= 1) && r <= n) && 2 <= r) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 43 locations, 1 error locations. SAFE Result, 28.6s OverallTime, 20 OverallIterations, 17 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 15.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1701 SDtfs, 1032 SDslu, 6079 SDs, 0 SdLazy, 4305 SolverSat, 2192 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 689 GetRequests, 477 SyntacticMatches, 2 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 916 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 894 PreInvPairs, 1315 NumberOfFragments, 1106 HoareAnnotationTreeSize, 894 FomulaSimplifications, 377784613 FormulaSimplificationTreeSizeReduction, 5.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 135087265 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1316 ConstructedInterpolants, 27 QuantifiedInterpolants, 256064 SizeOfPredicates, 19 NumberOfNonLiveVariables, 958 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 4034/4116 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...