java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:19,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:19,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:19,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:19,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:19,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:19,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:19,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:19,876 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:19,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:19,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:19,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:19,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:19,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:19,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:19,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:19,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:19,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:19,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:19,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:19,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:19,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:19,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:19,892 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:19,895 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:19,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:19,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:19,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:19,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:19,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:19,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:19,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:19,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:19,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:19,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:19,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:19,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:19,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:19,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:19,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:19,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:19,909 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-20 12:58:19,924 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:19,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:19,926 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:19,926 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:19,926 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:19,926 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:19,927 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:19,927 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:19,927 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:19,927 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:19,927 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:19,928 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:19,928 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:19,928 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:19,928 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:19,928 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:19,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:19,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:19,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:19,929 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:19,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:19,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:19,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:19,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:19,930 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:19,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:19,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:19,931 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:19,931 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:19,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:19,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:19,998 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:19,999 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:19,999 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:20,000 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6.i [2019-09-20 12:58:20,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c124f72b/13760913c4e54871b5f8568bc48731bf/FLAG0dfb4876c [2019-09-20 12:58:20,525 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:58:20,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6.i [2019-09-20 12:58:20,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c124f72b/13760913c4e54871b5f8568bc48731bf/FLAG0dfb4876c [2019-09-20 12:58:20,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c124f72b/13760913c4e54871b5f8568bc48731bf [2019-09-20 12:58:20,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:58:20,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:58:20,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:20,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:58:20,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:58:20,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:20" (1/1) ... [2019-09-20 12:58:20,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fc6e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:20, skipping insertion in model container [2019-09-20 12:58:20,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:58:20" (1/1) ... [2019-09-20 12:58:20,972 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:58:20,990 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:58:21,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:21,232 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:58:21,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:58:21,273 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:58:21,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21 WrapperNode [2019-09-20 12:58:21,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:58:21,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:58:21,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:58:21,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:58:21,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (1/1) ... [2019-09-20 12:58:21,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:58:21,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:58:21,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:58:21,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:58:21,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (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-20 12:58:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:58:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:58:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:58:21,477 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:58:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:58:21,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:58:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:58:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:58:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:58:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:58:21,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:58:21,679 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:58:21,680 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 12:58:21,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:21 BoogieIcfgContainer [2019-09-20 12:58:21,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:58:21,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:58:21,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:58:21,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:58:21,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:58:20" (1/3) ... [2019-09-20 12:58:21,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590dfccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:21, skipping insertion in model container [2019-09-20 12:58:21,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:58:21" (2/3) ... [2019-09-20 12:58:21,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590dfccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:58:21, skipping insertion in model container [2019-09-20 12:58:21,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:58:21" (3/3) ... [2019-09-20 12:58:21,689 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-09-20 12:58:21,699 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:58:21,706 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:58:21,727 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:58:21,783 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:58:21,784 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:58:21,785 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:58:21,785 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:58:21,785 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:58:21,785 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:58:21,785 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:58:21,786 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:58:21,786 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:58:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-20 12:58:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-20 12:58:21,813 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:21,813 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:21,816 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:21,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1213508388, now seen corresponding path program 1 times [2019-09-20 12:58:21,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:21,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:21,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,010 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-20 12:58:22,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:22,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:22,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:22,029 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 5 states. [2019-09-20 12:58:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,156 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2019-09-20 12:58:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:22,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-09-20 12:58:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,166 INFO L225 Difference]: With dead ends: 57 [2019-09-20 12:58:22,166 INFO L226 Difference]: Without dead ends: 28 [2019-09-20 12:58:22,170 INFO L636 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-20 12:58:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-20 12:58:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-20 12:58:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-20 12:58:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-20 12:58:22,214 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2019-09-20 12:58:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,214 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-20 12:58:22,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-20 12:58:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:58:22,216 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,216 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,217 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,217 INFO L82 PathProgramCache]: Analyzing trace with hash 542305890, now seen corresponding path program 1 times [2019-09-20 12:58:22,218 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,318 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-20 12:58:22,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:58:22,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:58:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:58:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:58:22,325 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2019-09-20 12:58:22,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,469 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-09-20 12:58:22,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 12:58:22,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-09-20 12:58:22,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,472 INFO L225 Difference]: With dead ends: 40 [2019-09-20 12:58:22,472 INFO L226 Difference]: Without dead ends: 38 [2019-09-20 12:58:22,473 INFO L636 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-20 12:58:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-20 12:58:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-09-20 12:58:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 12:58:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-09-20 12:58:22,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2019-09-20 12:58:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,482 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-09-20 12:58:22,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:58:22,483 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-09-20 12:58:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:58:22,484 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,484 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,484 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1063580357, now seen corresponding path program 1 times [2019-09-20 12:58:22,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,539 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-20 12:58:22,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:58:22,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:58:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:58:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:58:22,541 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 5 states. [2019-09-20 12:58:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,613 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-09-20 12:58:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:22,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-20 12:58:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,615 INFO L225 Difference]: With dead ends: 45 [2019-09-20 12:58:22,615 INFO L226 Difference]: Without dead ends: 43 [2019-09-20 12:58:22,616 INFO L636 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-20 12:58:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-20 12:58:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-20 12:58:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 12:58:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2019-09-20 12:58:22,628 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 20 [2019-09-20 12:58:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,628 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2019-09-20 12:58:22,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:58:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2019-09-20 12:58:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:58:22,630 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,630 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,630 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1462671860, now seen corresponding path program 1 times [2019-09-20 12:58:22,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:22,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:58:22,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 12:58:22,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:58:22,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:58:22,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:58:22,749 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2019-09-20 12:58:22,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:22,918 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2019-09-20 12:58:22,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:58:22,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-20 12:58:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:22,932 INFO L225 Difference]: With dead ends: 68 [2019-09-20 12:58:22,932 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 12:58:22,933 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-20 12:58:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 12:58:22,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-09-20 12:58:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 12:58:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-20 12:58:22,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 24 [2019-09-20 12:58:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:22,947 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-20 12:58:22,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:58:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-20 12:58:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:58:22,948 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:22,948 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:22,948 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -965699220, now seen corresponding path program 1 times [2019-09-20 12:58:22,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:22,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:22,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:58:23,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:23,051 INFO L224 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:23,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:23,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:58:23,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 12:58:23,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:23,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-09-20 12:58:23,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:58:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:58:23,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:58:23,219 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 11 states. [2019-09-20 12:58:25,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:25,508 INFO L93 Difference]: Finished difference Result 115 states and 151 transitions. [2019-09-20 12:58:25,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:58:25,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-20 12:58:25,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:25,510 INFO L225 Difference]: With dead ends: 115 [2019-09-20 12:58:25,510 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 12:58:25,511 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:58:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 12:58:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 50. [2019-09-20 12:58:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 12:58:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2019-09-20 12:58:25,523 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 27 [2019-09-20 12:58:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:25,523 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2019-09-20 12:58:25,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:58:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2019-09-20 12:58:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:58:25,525 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:25,525 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:25,525 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1830678608, now seen corresponding path program 1 times [2019-09-20 12:58:25,526 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:25,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:25,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:25,593 INFO L224 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-20 12:58:25,614 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-20 12:58:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 12:58:25,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 12:58:25,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:25,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-20 12:58:25,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:58:25,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:58:25,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:58:25,670 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand 9 states. [2019-09-20 12:58:25,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:25,815 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2019-09-20 12:58:25,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:58:25,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-09-20 12:58:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:25,817 INFO L225 Difference]: With dead ends: 97 [2019-09-20 12:58:25,817 INFO L226 Difference]: Without dead ends: 59 [2019-09-20 12:58:25,818 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:58:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-20 12:58:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-09-20 12:58:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-20 12:58:25,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-09-20 12:58:25,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 31 [2019-09-20 12:58:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:25,828 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-09-20 12:58:25,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:58:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-09-20 12:58:25,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 12:58:25,830 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:25,830 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:25,830 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:25,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:25,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1063418416, now seen corresponding path program 1 times [2019-09-20 12:58:25,831 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:25,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:25,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:25,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:58:25,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:25,914 INFO L224 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) [2019-09-20 12:58:25,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:25,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:58:25,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 12:58:26,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 12:58:26,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-20 12:58:26,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-20 12:58:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-20 12:58:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:58:26,072 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 14 states. [2019-09-20 12:58:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:26,433 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2019-09-20 12:58:26,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-20 12:58:26,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-20 12:58:26,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:26,435 INFO L225 Difference]: With dead ends: 120 [2019-09-20 12:58:26,435 INFO L226 Difference]: Without dead ends: 86 [2019-09-20 12:58:26,438 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-09-20 12:58:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-20 12:58:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2019-09-20 12:58:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-20 12:58:26,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-09-20 12:58:26,464 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 34 [2019-09-20 12:58:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:26,464 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-09-20 12:58:26,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-20 12:58:26,465 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2019-09-20 12:58:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 12:58:26,467 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:26,467 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:26,468 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1968312716, now seen corresponding path program 2 times [2019-09-20 12:58:26,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:26,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:26,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:58:26,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:26,593 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:26,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:58:26,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:58:26,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:58:26,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 12:58:26,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:26,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:58:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-20 12:58:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-09-20 12:58:26,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:58:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:58:26,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:58:26,692 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 13 states. [2019-09-20 12:58:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:27,120 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2019-09-20 12:58:27,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-20 12:58:27,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-09-20 12:58:27,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:27,122 INFO L225 Difference]: With dead ends: 97 [2019-09-20 12:58:27,122 INFO L226 Difference]: Without dead ends: 95 [2019-09-20 12:58:27,123 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-09-20 12:58:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-20 12:58:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2019-09-20 12:58:27,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 12:58:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-09-20 12:58:27,137 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 38 [2019-09-20 12:58:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:27,137 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-09-20 12:58:27,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:58:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-09-20 12:58:27,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 12:58:27,145 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:58:27,145 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:58:27,145 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:58:27,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:58:27,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1032911483, now seen corresponding path program 1 times [2019-09-20 12:58:27,146 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:58:27,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:58:27,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:27,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:58:27,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:58:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:58:27,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 12:58:27,272 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 12:58:27,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:58:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:58:27,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 12:58:27,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:58:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 12:58:27,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:58:27,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-09-20 12:58:27,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 12:58:27,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 12:58:27,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:58:27,372 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 13 states. [2019-09-20 12:58:27,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:58:27,745 INFO L93 Difference]: Finished difference Result 116 states and 151 transitions. [2019-09-20 12:58:27,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 12:58:27,746 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-20 12:58:27,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:58:27,746 INFO L225 Difference]: With dead ends: 116 [2019-09-20 12:58:27,747 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 12:58:27,748 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2019-09-20 12:58:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 12:58:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 12:58:27,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 12:58:27,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 12:58:27,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-09-20 12:58:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:58:27,751 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 12:58:27,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 12:58:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 12:58:27,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 12:58:27,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-20 12:58:28,294 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 20 [2019-09-20 12:58:28,503 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-20 12:58:28,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:28,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-20 12:58:28,503 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-20 12:58:28,503 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-20 12:58:28,503 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-20 12:58:28,504 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-09-20 12:58:28,504 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2019-09-20 12:58:28,504 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2019-09-20 12:58:28,504 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))) [2019-09-20 12:58:28,504 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2019-09-20 12:58:28,504 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-09-20 12:58:28,505 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0)) (.cse2 (<= main_~n~0 main_~j~0))) (or (and (and .cse0 .cse1) (<= main_~i~0 0)) (and .cse0 .cse1 .cse2) (let ((.cse3 (div (+ (- main_~n~0) 1) (- 2)))) (and (<= .cse3 0) (<= (+ .cse3 1) main_~i~0) (<= main_~k~0 main_~i~0) .cse1 .cse2)))) [2019-09-20 12:58:28,505 INFO L443 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-09-20 12:58:28,505 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-09-20 12:58:28,505 INFO L446 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-09-20 12:58:28,506 INFO L443 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2019-09-20 12:58:28,506 INFO L439 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (let ((.cse1 (and (<= .cse0 main_~j~0) (<= main_~n~0 main_~k~0)))) (or (and (<= main_~k~0 (+ .cse0 1)) (<= main_~i~0 0) (and .cse1 (<= main_~k~0 main_~j~0))) (and (<= main_~k~0 main_~n~0) .cse1)))) [2019-09-20 12:58:28,506 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-09-20 12:58:28,507 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2019-09-20 12:58:28,507 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2019-09-20 12:58:28,507 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2019-09-20 12:58:28,507 INFO L443 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-09-20 12:58:28,508 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-20 12:58:28,508 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:58:28,508 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-20 12:58:28,508 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-20 12:58:28,508 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-20 12:58:28,509 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-20 12:58:28,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 12:58:28 BoogieIcfgContainer [2019-09-20 12:58:28,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 12:58:28,553 INFO L168 Benchmark]: Toolchain (without parser) took 7597.57 ms. Allocated memory was 132.6 MB in the beginning and 313.0 MB in the end (delta: 180.4 MB). Free memory was 88.1 MB in the beginning and 255.1 MB in the end (delta: -167.1 MB). Peak memory consumption was 134.9 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:28,556 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 12:58:28,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.34 ms. Allocated memory is still 132.6 MB. Free memory was 87.9 MB in the beginning and 78.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:28,560 INFO L168 Benchmark]: Boogie Preprocessor took 142.22 ms. Allocated memory was 132.6 MB in the beginning and 198.7 MB in the end (delta: 66.1 MB). Free memory was 78.4 MB in the beginning and 174.8 MB in the end (delta: -96.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:28,565 INFO L168 Benchmark]: RCFGBuilder took 264.03 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 161.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:28,568 INFO L168 Benchmark]: TraceAbstraction took 6867.13 ms. Allocated memory was 198.7 MB in the beginning and 313.0 MB in the end (delta: 114.3 MB). Free memory was 160.8 MB in the beginning and 255.1 MB in the end (delta: -94.3 MB). Peak memory consumption was 141.7 MB. Max. memory is 7.1 GB. [2019-09-20 12:58:28,576 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.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 317.34 ms. Allocated memory is still 132.6 MB. Free memory was 87.9 MB in the beginning and 78.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.22 ms. Allocated memory was 132.6 MB in the beginning and 198.7 MB in the end (delta: 66.1 MB). Free memory was 78.4 MB in the beginning and 174.8 MB in the end (delta: -96.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 264.03 ms. Allocated memory is still 198.7 MB. Free memory was 174.8 MB in the beginning and 161.4 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6867.13 ms. Allocated memory was 198.7 MB in the beginning and 313.0 MB in the end (delta: 114.3 MB). Free memory was 160.8 MB in the beginning and 255.1 MB in the end (delta: -94.3 MB). Peak memory consumption was 141.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((k <= 2 * i + 1 && i <= 0) && (2 * i <= j && n <= k) && k <= j) || (k <= n && 2 * i <= j && n <= k) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((j < n && 2 * i <= j) && 2 * i <= k) && k <= n - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((k <= n && n <= k) && i <= 0) || ((k <= n && n <= k) && n <= j)) || (((((-n + 1) / -2 <= 0 && (-n + 1) / -2 + 1 <= i) && k <= i) && n <= k) && n <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 268 SDtfs, 199 SDslu, 1233 SDs, 0 SdLazy, 1150 SolverSat, 184 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 126 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 47 PreInvPairs, 84 NumberOfFragments, 166 HoareAnnotationTreeSize, 47 FomulaSimplifications, 20675 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 5263 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 415 NumberOfCodeBlocks, 415 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 401 ConstructedInterpolants, 1 QuantifiedInterpolants, 29706 SizeOfPredicates, 16 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 149/182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...