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/loops/sum01-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:28:51,180 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:28:51,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:28:51,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:28:51,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:28:51,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:28:51,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:28:51,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:28:51,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:28:51,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:28:51,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:28:51,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:28:51,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:28:51,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:28:51,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:28:51,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:28:51,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:28:51,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:28:51,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:28:51,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:28:51,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:28:51,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:28:51,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:28:51,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:28:51,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:28:51,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:28:51,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:28:51,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:28:51,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:28:51,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:28:51,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:28:51,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:28:51,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:28:51,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:28:51,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:28:51,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:28:51,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:28:51,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:28:51,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:28:51,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:28:51,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:28:51,231 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:28:51,245 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:28:51,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:28:51,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:28:51,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:28:51,247 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:28:51,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:28:51,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:28:51,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:28:51,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:28:51,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:28:51,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:28:51,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:28:51,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:28:51,251 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:28:51,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:28:51,252 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:28:51,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:28:51,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:28:51,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:28:51,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:28:51,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:28:51,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:28:51,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:28:51,254 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:28:51,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:28:51,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:28:51,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:28:51,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:28:51,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:28:51,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:28:51,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:28:51,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:28:51,309 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:28:51,309 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:28:51,310 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2019-10-02 11:28:51,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc24417e/fa4e5d32ec2a4cb7a716d54b0271af13/FLAG7af59b1cd [2019-10-02 11:28:51,860 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:28:51,861 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2019-10-02 11:28:51,868 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc24417e/fa4e5d32ec2a4cb7a716d54b0271af13/FLAG7af59b1cd [2019-10-02 11:28:52,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc24417e/fa4e5d32ec2a4cb7a716d54b0271af13 [2019-10-02 11:28:52,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:28:52,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:28:52,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:28:52,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:28:52,374 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:28:52,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,378 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262ccb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52, skipping insertion in model container [2019-10-02 11:28:52,378 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,385 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:28:52,398 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:28:52,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:28:52,572 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:28:52,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:28:52,606 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:28:52,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52 WrapperNode [2019-10-02 11:28:52,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:28:52,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:28:52,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:28:52,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:28:52,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... [2019-10-02 11:28:52,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:28:52,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:28:52,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:28:52,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:28:52,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:28:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:28:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:28:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-02 11:28:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:28:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:28:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-02 11:28:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 11:28:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:28:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:28:52,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:28:52,960 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:28:52,961 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 11:28:52,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:28:52 BoogieIcfgContainer [2019-10-02 11:28:52,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:28:52,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:28:52,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:28:52,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:28:52,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:28:52" (1/3) ... [2019-10-02 11:28:52,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3956cbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:28:52, skipping insertion in model container [2019-10-02 11:28:52,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:28:52" (2/3) ... [2019-10-02 11:28:52,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3956cbbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:28:52, skipping insertion in model container [2019-10-02 11:28:52,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:28:52" (3/3) ... [2019-10-02 11:28:52,974 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2019-10-02 11:28:52,985 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:28:53,026 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:28:53,072 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:28:53,110 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:28:53,111 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:28:53,111 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:28:53,111 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:28:53,111 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:28:53,111 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:28:53,111 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:28:53,112 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:28:53,112 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:28:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-10-02 11:28:53,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:28:53,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:53,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:53,136 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-10-02 11:28:53,142 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:53,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:53,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:53,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:28:53,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 11:28:53,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 11:28:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 11:28:53,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:28:53,276 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-10-02 11:28:53,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:53,295 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2019-10-02 11:28:53,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 11:28:53,297 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-02 11:28:53,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:53,304 INFO L225 Difference]: With dead ends: 30 [2019-10-02 11:28:53,304 INFO L226 Difference]: Without dead ends: 13 [2019-10-02 11:28:53,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 11:28:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-02 11:28:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-02 11:28:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-02 11:28:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-02 11:28:53,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-10-02 11:28:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:53,343 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-02 11:28:53,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 11:28:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-02 11:28:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-02 11:28:53,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:53,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:53,349 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:53,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2019-10-02 11:28:53,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:53,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:53,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:53,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:53,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:53,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:28:53,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:28:53,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:28:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:28:53,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:28:53,439 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-10-02 11:28:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:53,477 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-02 11:28:53,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:28:53,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-02 11:28:53,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:53,479 INFO L225 Difference]: With dead ends: 21 [2019-10-02 11:28:53,479 INFO L226 Difference]: Without dead ends: 16 [2019-10-02 11:28:53,480 INFO L640 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-10-02 11:28:53,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-02 11:28:53,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-02 11:28:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-02 11:28:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-10-02 11:28:53,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2019-10-02 11:28:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:53,486 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-10-02 11:28:53,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:28:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-10-02 11:28:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 11:28:53,487 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:53,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:53,487 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:53,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2019-10-02 11:28:53,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:53,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:53,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:53,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:53,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:53,751 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-10-02 11:28:53,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:53,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 11:28:53,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:53,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:54,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:54,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-02 11:28:54,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 11:28:54,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 11:28:54,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:28:54,022 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2019-10-02 11:28:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:54,316 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-02 11:28:54,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:28:54,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2019-10-02 11:28:54,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:54,319 INFO L225 Difference]: With dead ends: 37 [2019-10-02 11:28:54,319 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:28:54,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-10-02 11:28:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:28:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-10-02 11:28:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-02 11:28:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-02 11:28:54,331 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2019-10-02 11:28:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:54,332 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-02 11:28:54,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 11:28:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-02 11:28:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:28:54,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:54,334 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:54,334 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1350121109, now seen corresponding path program 1 times [2019-10-02 11:28:54,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:54,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:54,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:54,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:54,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:54,418 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:28:54,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:54,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:28:54,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:54,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:54,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 11:28:54,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:28:54,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:28:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:28:54,477 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-10-02 11:28:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:54,522 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-10-02 11:28:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:28:54,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-02 11:28:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:54,524 INFO L225 Difference]: With dead ends: 30 [2019-10-02 11:28:54,524 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 11:28:54,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:28:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 11:28:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-02 11:28:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 11:28:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-02 11:28:54,535 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-10-02 11:28:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:54,538 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-02 11:28:54,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:28:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-02 11:28:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 11:28:54,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:54,539 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:54,540 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:54,540 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 2 times [2019-10-02 11:28:54,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:28:54,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-02 11:28:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:54,824 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-10-02 11:28:54,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:28:54,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:28:54,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:54,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 11:28:54,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:55,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 11:28:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:55,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:55,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2019-10-02 11:28:55,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 11:28:55,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 11:28:55,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-02 11:28:55,140 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2019-10-02 11:28:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:55,683 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-10-02 11:28:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:28:55,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2019-10-02 11:28:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:55,684 INFO L225 Difference]: With dead ends: 40 [2019-10-02 11:28:55,685 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 11:28:55,686 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:28:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 11:28:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-02 11:28:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 11:28:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-10-02 11:28:55,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2019-10-02 11:28:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:55,692 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-10-02 11:28:55,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 11:28:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-10-02 11:28:55,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-02 11:28:55,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:55,693 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:55,694 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1753373675, now seen corresponding path program 2 times [2019-10-02 11:28:55,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:55,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:55,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:55,775 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:55,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:55,776 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-10-02 11:28:55,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 11:28:55,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 11:28:55,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:55,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:28:55,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:55,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:55,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-10-02 11:28:55,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:28:55,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:28:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:28:55,843 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2019-10-02 11:28:55,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:55,899 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2019-10-02 11:28:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:28:55,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-02 11:28:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:55,902 INFO L225 Difference]: With dead ends: 39 [2019-10-02 11:28:55,902 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 11:28:55,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:28:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 11:28:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-02 11:28:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 11:28:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-10-02 11:28:55,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2019-10-02 11:28:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:55,914 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-10-02 11:28:55,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:28:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-10-02 11:28:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 11:28:55,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:55,916 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:55,916 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958777, now seen corresponding path program 3 times [2019-10-02 11:28:55,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:55,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:55,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:55,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:55,994 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-10-02 11:28:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 11:28:56,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-02 11:28:56,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:56,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:28:56,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:56,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:56,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-10-02 11:28:56,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:28:56,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:28:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:28:56,045 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-10-02 11:28:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:56,110 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-10-02 11:28:56,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:28:56,112 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-02 11:28:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:56,113 INFO L225 Difference]: With dead ends: 42 [2019-10-02 11:28:56,114 INFO L226 Difference]: Without dead ends: 34 [2019-10-02 11:28:56,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:28:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-02 11:28:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-02 11:28:56,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-02 11:28:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-10-02 11:28:56,129 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2019-10-02 11:28:56,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:56,130 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-10-02 11:28:56,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:28:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-10-02 11:28:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 11:28:56,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:56,131 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:56,131 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:56,132 INFO L82 PathProgramCache]: Analyzing trace with hash 98169237, now seen corresponding path program 4 times [2019-10-02 11:28:56,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:56,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:56,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:56,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:56,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:56,244 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 11:28:56,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:28:56,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 11:28:56,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:56,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:28:56,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:56,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-10-02 11:28:56,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:28:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:28:56,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:28:56,305 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2019-10-02 11:28:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:56,366 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-10-02 11:28:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:28:56,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-10-02 11:28:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:56,369 INFO L225 Difference]: With dead ends: 45 [2019-10-02 11:28:56,370 INFO L226 Difference]: Without dead ends: 37 [2019-10-02 11:28:56,371 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:28:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-02 11:28:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-10-02 11:28:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-02 11:28:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-02 11:28:56,382 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2019-10-02 11:28:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:56,382 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-02 11:28:56,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:28:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-02 11:28:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 11:28:56,384 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:56,384 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:56,384 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:56,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:56,385 INFO L82 PathProgramCache]: Analyzing trace with hash 144867641, now seen corresponding path program 5 times [2019-10-02 11:28:56,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:56,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:56,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:56,486 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:56,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:56,487 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:28:56,507 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 11:28:56,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-02 11:28:56,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:56,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:28:56,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:56,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-10-02 11:28:56,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:28:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:28:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:28:56,545 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2019-10-02 11:28:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:56,591 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-10-02 11:28:56,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:28:56,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-10-02 11:28:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:56,595 INFO L225 Difference]: With dead ends: 48 [2019-10-02 11:28:56,595 INFO L226 Difference]: Without dead ends: 40 [2019-10-02 11:28:56,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:28:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-02 11:28:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-02 11:28:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 11:28:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-02 11:28:56,608 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2019-10-02 11:28:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:56,610 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-02 11:28:56,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:28:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-02 11:28:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 11:28:56,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:56,611 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:56,611 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:56,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash -232382699, now seen corresponding path program 6 times [2019-10-02 11:28:56,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:56,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:56,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:28:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:28:56,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:28:56,752 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:28:56,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 11:28:56,811 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-02 11:28:56,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 11:28:56,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 11:28:56,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:28:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:28:56,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:28:56,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-10-02 11:28:56,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:28:56,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:28:56,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:28:56,832 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2019-10-02 11:28:56,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:28:56,907 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-10-02 11:28:56,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:28:56,908 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-10-02 11:28:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:28:56,909 INFO L225 Difference]: With dead ends: 51 [2019-10-02 11:28:56,909 INFO L226 Difference]: Without dead ends: 43 [2019-10-02 11:28:56,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:28:56,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-02 11:28:56,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-10-02 11:28:56,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 11:28:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-02 11:28:56,915 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2019-10-02 11:28:56,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:28:56,916 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-02 11:28:56,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:28:56,916 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-02 11:28:56,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 11:28:56,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:28:56,917 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:28:56,918 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:28:56,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:28:56,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1032151993, now seen corresponding path program 7 times [2019-10-02 11:28:56,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:28:56,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:28:56,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 11:28:56,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:28:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 11:28:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 11:28:56,989 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 11:28:57,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:28:57 BoogieIcfgContainer [2019-10-02 11:28:57,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 11:28:57,040 INFO L168 Benchmark]: Toolchain (without parser) took 4667.61 ms. Allocated memory was 134.2 MB in the beginning and 258.5 MB in the end (delta: 124.3 MB). Free memory was 88.8 MB in the beginning and 206.8 MB in the end (delta: -117.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:28:57,041 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 11:28:57,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.27 ms. Allocated memory is still 134.2 MB. Free memory was 88.6 MB in the beginning and 79.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-02 11:28:57,049 INFO L168 Benchmark]: Boogie Preprocessor took 109.81 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 79.3 MB in the beginning and 177.8 MB in the end (delta: -98.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-10-02 11:28:57,050 INFO L168 Benchmark]: RCFGBuilder took 244.48 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 166.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2019-10-02 11:28:57,051 INFO L168 Benchmark]: TraceAbstraction took 4069.85 ms. Allocated memory was 200.8 MB in the beginning and 258.5 MB in the end (delta: 57.7 MB). Free memory was 165.8 MB in the beginning and 206.8 MB in the end (delta: -41.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2019-10-02 11:28:57,064 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 134.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 236.27 ms. Allocated memory is still 134.2 MB. Free memory was 88.6 MB in the beginning and 79.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 109.81 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 79.3 MB in the beginning and 177.8 MB in the end (delta: -98.5 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 244.48 ms. Allocated memory is still 200.8 MB. Free memory was 177.8 MB in the beginning and 166.4 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4069.85 ms. Allocated memory was 200.8 MB in the beginning and 258.5 MB in the end (delta: 57.7 MB). Free memory was 165.8 MB in the beginning and 206.8 MB in the end (delta: -41.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=10, n=0] [L13] COND TRUE i<=n VAL [i=1, n=0, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=2, n=10] [L13] i++ VAL [i=2, n=2, n=10] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=10, n=4] [L13] COND TRUE i<=n VAL [i=3, n=4, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=6, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=8, n=10] [L13] i++ VAL [i=5, n=8, n=10] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=10, n=12] [L13] i++ VAL [i=7, n=12, n=10] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=14, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=10, n=16] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=10, n=18] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=10, n=18] [L14] COND FALSE !(i<10) VAL [i=10, n=10, n=18] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 3.9s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 114 SDtfs, 62 SDslu, 435 SDs, 0 SdLazy, 504 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 29868 SizeOfPredicates, 12 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 145/780 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...