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-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 19:41:23,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 19:41:23,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 19:41:23,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 19:41:23,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 19:41:23,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 19:41:23,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 19:41:23,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 19:41:23,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 19:41:23,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 19:41:23,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 19:41:23,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 19:41:23,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 19:41:23,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 19:41:23,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 19:41:23,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 19:41:23,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 19:41:23,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 19:41:23,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 19:41:23,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 19:41:23,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 19:41:23,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 19:41:23,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 19:41:23,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 19:41:23,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 19:41:23,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 19:41:23,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 19:41:23,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 19:41:23,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 19:41:23,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 19:41:23,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 19:41:23,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 19:41:23,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 19:41:23,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 19:41:23,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 19:41:23,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 19:41:23,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 19:41:23,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 19:41:23,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 19:41:23,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 19:41:23,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 19:41:23,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-03 19:41:23,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 19:41:23,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 19:41:23,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 19:41:23,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 19:41:23,960 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 19:41:23,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 19:41:23,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 19:41:23,961 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 19:41:23,961 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 19:41:23,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 19:41:23,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 19:41:23,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 19:41:23,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 19:41:23,962 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 19:41:23,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 19:41:23,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 19:41:23,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 19:41:23,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 19:41:23,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 19:41:23,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 19:41:23,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 19:41:23,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:41:23,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 19:41:23,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 19:41:23,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 19:41:23,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 19:41:23,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 19:41:23,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 19:41:23,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 19:41:23,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 19:41:24,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 19:41:24,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 19:41:24,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 19:41:24,008 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 19:41:24,008 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2019-09-03 19:41:24,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8748e567e/d045b72b56bf4cedb87879cfda2e0884/FLAG6ac5bd0c6 [2019-09-03 19:41:24,475 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 19:41:24,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2019-09-03 19:41:24,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8748e567e/d045b72b56bf4cedb87879cfda2e0884/FLAG6ac5bd0c6 [2019-09-03 19:41:24,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8748e567e/d045b72b56bf4cedb87879cfda2e0884 [2019-09-03 19:41:24,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 19:41:24,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 19:41:24,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 19:41:24,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 19:41:24,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 19:41:24,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:41:24" (1/1) ... [2019-09-03 19:41:24,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:24, skipping insertion in model container [2019-09-03 19:41:24,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 07:41:24" (1/1) ... [2019-09-03 19:41:24,902 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 19:41:24,917 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 19:41:25,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:41:25,102 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 19:41:25,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 19:41:25,129 INFO L192 MainTranslator]: Completed translation [2019-09-03 19:41:25,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25 WrapperNode [2019-09-03 19:41:25,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 19:41:25,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 19:41:25,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 19:41:25,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 19:41:25,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... [2019-09-03 19:41:25,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 19:41:25,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 19:41:25,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 19:41:25,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 19:41:25,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 19:41:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 19:41:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 19:41:25,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 19:41:25,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 19:41:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 19:41:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 19:41:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 19:41:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 19:41:25,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 19:41:25,443 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 19:41:25,443 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 19:41:25,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:41:25 BoogieIcfgContainer [2019-09-03 19:41:25,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 19:41:25,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 19:41:25,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 19:41:25,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 19:41:25,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 07:41:24" (1/3) ... [2019-09-03 19:41:25,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a02f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:41:25, skipping insertion in model container [2019-09-03 19:41:25,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 07:41:25" (2/3) ... [2019-09-03 19:41:25,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3a02f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 07:41:25, skipping insertion in model container [2019-09-03 19:41:25,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 07:41:25" (3/3) ... [2019-09-03 19:41:25,452 INFO L109 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2019-09-03 19:41:25,461 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 19:41:25,469 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 19:41:25,486 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 19:41:25,518 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 19:41:25,519 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 19:41:25,519 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 19:41:25,519 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 19:41:25,519 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 19:41:25,519 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 19:41:25,520 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 19:41:25,520 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 19:41:25,520 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 19:41:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-09-03 19:41:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 19:41:25,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:25,539 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:25,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:25,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2019-09-03 19:41:25,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:25,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:25,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:25,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:41:25,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:25,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 19:41:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 19:41:25,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 19:41:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 19:41:25,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:41:25,753 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-09-03 19:41:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:25,792 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-03 19:41:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 19:41:25,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-03 19:41:25,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:25,803 INFO L225 Difference]: With dead ends: 29 [2019-09-03 19:41:25,804 INFO L226 Difference]: Without dead ends: 12 [2019-09-03 19:41:25,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 19:41:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-03 19:41:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-03 19:41:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-03 19:41:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-09-03 19:41:25,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-09-03 19:41:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:25,856 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-09-03 19:41:25,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 19:41:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-09-03 19:41:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 19:41:25,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:25,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:25,861 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2019-09-03 19:41:25,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:25,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:25,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:25,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:41:25,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:26,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:41:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:26,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-03 19:41:26,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:26,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-03 19:41:26,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 19:41:26,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 19:41:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:41:26,126 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 5 states. [2019-09-03 19:41:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:26,147 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-09-03 19:41:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-03 19:41:26,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-09-03 19:41:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:26,149 INFO L225 Difference]: With dead ends: 18 [2019-09-03 19:41:26,149 INFO L226 Difference]: Without dead ends: 13 [2019-09-03 19:41:26,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 19:41:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-09-03 19:41:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-09-03 19:41:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-09-03 19:41:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-09-03 19:41:26,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-09-03 19:41:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:26,156 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-09-03 19:41:26,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 19:41:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-09-03 19:41:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 19:41:26,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:26,157 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:26,157 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:26,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1490448798, now seen corresponding path program 2 times [2019-09-03 19:41:26,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:41:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:26,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:26,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 19:41:26,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 19:41:26,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:26,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 19:41:26,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:26,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-03 19:41:26,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 19:41:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 19:41:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:41:26,332 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 6 states. [2019-09-03 19:41:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:26,363 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:41:26,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 19:41:26,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-03 19:41:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:26,365 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:41:26,365 INFO L226 Difference]: Without dead ends: 14 [2019-09-03 19:41:26,366 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-03 19:41:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-03 19:41:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-03 19:41:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-03 19:41:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-09-03 19:41:26,370 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-09-03 19:41:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:26,371 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-09-03 19:41:26,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 19:41:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-09-03 19:41:26,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-03 19:41:26,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:26,372 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:26,372 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:26,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:26,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 3 times [2019-09-03 19:41:26,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:26,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:26,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:26,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:26,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:41:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:26,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 19:41:26,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:26,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 19:41:26,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:26,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-03 19:41:26,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 19:41:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 19:41:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:41:26,524 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 7 states. [2019-09-03 19:41:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:26,563 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-09-03 19:41:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 19:41:26,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-09-03 19:41:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:26,564 INFO L225 Difference]: With dead ends: 20 [2019-09-03 19:41:26,564 INFO L226 Difference]: Without dead ends: 15 [2019-09-03 19:41:26,565 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-03 19:41:26,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-09-03 19:41:26,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-09-03 19:41:26,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-09-03 19:41:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-09-03 19:41:26,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-09-03 19:41:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:26,570 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-09-03 19:41:26,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 19:41:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-09-03 19:41:26,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-03 19:41:26,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:26,572 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:26,572 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:26,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:26,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 4 times [2019-09-03 19:41:26,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:26,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:26,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:26,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:41:26,726 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:26,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 19:41:26,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:26,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 19:41:26,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:26,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:26,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-03 19:41:26,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 19:41:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 19:41:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:41:26,784 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-09-03 19:41:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:26,828 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-09-03 19:41:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 19:41:26,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-09-03 19:41:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:26,830 INFO L225 Difference]: With dead ends: 21 [2019-09-03 19:41:26,831 INFO L226 Difference]: Without dead ends: 16 [2019-09-03 19:41:26,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-03 19:41:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-03 19:41:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-03 19:41:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-03 19:41:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-09-03 19:41:26,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-09-03 19:41:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:26,838 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-09-03 19:41:26,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 19:41:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-09-03 19:41:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-03 19:41:26,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:26,839 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:26,839 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1860436335, now seen corresponding path program 5 times [2019-09-03 19:41:26,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:26,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:26,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:26,984 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-03 19:41:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:27,014 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-03 19:41:27,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:27,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 19:41:27,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:41:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:27,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:41:27,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-03 19:41:27,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 19:41:27,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 19:41:27,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:41:27,049 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-09-03 19:41:27,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:41:27,103 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-09-03 19:41:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 19:41:27,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-09-03 19:41:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:41:27,106 INFO L225 Difference]: With dead ends: 22 [2019-09-03 19:41:27,106 INFO L226 Difference]: Without dead ends: 17 [2019-09-03 19:41:27,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-03 19:41:27,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-03 19:41:27,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-03 19:41:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-03 19:41:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-09-03 19:41:27,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-09-03 19:41:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:41:27,114 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-09-03 19:41:27,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 19:41:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-09-03 19:41:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 19:41:27,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:41:27,115 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:41:27,115 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:41:27,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:41:27,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1802490274, now seen corresponding path program 6 times [2019-09-03 19:41:27,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:41:27,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:41:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:27,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:41:27,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:41:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:41:36,697 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 18 [2019-09-03 19:41:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:41:36,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:41:36,740 INFO L223 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 19:41:36,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-03 19:41:36,782 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-09-03 19:41:36,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 19:41:36,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 19:41:36,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:42:04,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:42:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:42:04,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:42:04,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:42:04,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 19:42:33,930 WARN L188 SmtUtils]: Spent 8.76 s on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-03 19:43:01,142 WARN L188 SmtUtils]: Spent 4.43 s on a formula simplification that was a NOOP. DAG size: 74 [2019-09-03 19:43:01,191 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 19:43:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2019-09-03 19:43:01,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-03 19:43:01,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-03 19:43:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=266, Unknown=26, NotChecked=0, Total=342 [2019-09-03 19:43:01,198 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 19 states. [2019-09-03 19:43:55,667 WARN L188 SmtUtils]: Spent 21.53 s on a formula simplification that was a NOOP. DAG size: 85 [2019-09-03 19:43:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:57,837 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-09-03 19:43:57,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-03 19:43:57,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-09-03 19:43:57,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:57,838 INFO L225 Difference]: With dead ends: 27 [2019-09-03 19:43:57,838 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 19:43:57,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 115.5s TimeCoverageRelationStatistics Valid=61, Invalid=333, Unknown=26, NotChecked=0, Total=420 [2019-09-03 19:43:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 19:43:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 19:43:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 19:43:57,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-09-03 19:43:57,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-09-03 19:43:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:57,843 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-09-03 19:43:57,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-03 19:43:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-09-03 19:43:57,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 19:43:57,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 19:43:57,844 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 19:43:57,845 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 19:43:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 19:43:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash -154572610, now seen corresponding path program 7 times [2019-09-03 19:43:57,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 19:43:57,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 19:43:57,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:57,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 19:43:57,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 19:43:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:43:57,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 19:43:57,943 INFO L223 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-09-03 19:43:57,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 19:43:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 19:43:57,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 19:43:57,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 19:43:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 19:43:58,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 19:43:58,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-03 19:43:58,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 19:43:58,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 19:43:58,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:43:58,004 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2019-09-03 19:43:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 19:43:58,050 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-09-03 19:43:58,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 19:43:58,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-09-03 19:43:58,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 19:43:58,051 INFO L225 Difference]: With dead ends: 19 [2019-09-03 19:43:58,051 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 19:43:58,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-03 19:43:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 19:43:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 19:43:58,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 19:43:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 19:43:58,053 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-09-03 19:43:58,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 19:43:58,053 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 19:43:58,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 19:43:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 19:43:58,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 19:43:58,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 19:43:58,331 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 18 [2019-09-03 19:43:58,707 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-09-03 19:43:58,722 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 19:43:58,723 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:43:58,723 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 19:43:58,723 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 19:43:58,723 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 19:43:58,723 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 19:43:58,723 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2019-09-03 19:43:58,723 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2019-09-03 19:43:58,724 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2019-09-03 19:43:58,724 INFO L439 ceAbstractionStarter]: At program point L14-2(lines 14 17) the Hoare annotation is: (let ((.cse16 (div (- main_~y~0) (- 2)))) (let ((.cse7 (div main_~y~0 2)) (.cse4 (div .cse16 2))) (let ((.cse15 (div (- .cse4) (- 2))) (.cse17 (div (- .cse7) (- 2)))) (let ((.cse0 (= (mod main_~y~0 2) 0)) (.cse2 (= (mod .cse7 (- 2)) 0)) (.cse3 (= 0 (mod .cse17 2))) (.cse1 (div .cse17 2)) (.cse5 (= (mod main_~y~0 (- 2)) 0)) (.cse8 (= 0 (mod .cse15 2))) (.cse9 (= (mod .cse4 (- 2)) 0)) (.cse6 (= (mod .cse16 2) 0)) (.cse10 (div .cse15 2))) (or (and .cse0 (<= main_~x~0 3) (<= .cse1 1) .cse2 (<= 3 main_~x~0) (<= 1 .cse1) .cse3) (and (<= 1 .cse4) .cse5 (<= 2 main_~x~0) .cse6 (<= main_~x~0 2) (<= .cse4 1)) (and (<= 1 main_~y~0) (<= main_~x~0 0) (<= main_~y~0 1) (<= 0 main_~x~0)) (and (<= .cse7 1) .cse0 (<= main_~x~0 1) (<= 1 main_~x~0) (<= 1 .cse7)) (let ((.cse11 (div (- .cse10) (- 2)))) (let ((.cse12 (div .cse11 2))) (and .cse5 .cse8 .cse9 (= (mod .cse10 (- 2)) 0) (<= main_~x~0 6) (= (mod .cse11 2) 0) .cse6 (<= 6 main_~x~0) (<= .cse12 1) (<= 1 .cse12)))) (let ((.cse13 (div (- .cse1) (- 2)))) (let ((.cse14 (div .cse13 2))) (and (= (mod .cse13 2) 0) .cse0 (= (mod .cse1 (- 2)) 0) (<= 1 .cse14) (<= 5 main_~x~0) .cse2 .cse3 (<= .cse14 1) (<= main_~x~0 5)))) (and (<= .cse10 1) .cse5 .cse8 (<= 4 main_~x~0) .cse9 .cse6 (<= main_~x~0 4) (<= 1 .cse10))))))) [2019-09-03 19:43:58,725 INFO L439 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (not (= main_~y~0 (let ((.cse0 (div main_~y~0 4294967296))) (let ((.cse1 (* (- 4294967296) .cse0))) (let ((.cse2 (div (+ .cse1 main_~y~0) 3))) (+ (* 4294967296 .cse0) (* 4294967296 (div (+ .cse1 main_~y~0 (* (- 3) .cse2)) 4294967296)) (* 3 .cse2))))))) [2019-09-03 19:43:58,725 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-09-03 19:43:58,725 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-09-03 19:43:58,725 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:43:58,725 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-09-03 19:43:58,725 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-09-03 19:43:58,725 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-09-03 19:43:58,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 07:43:58 BoogieIcfgContainer [2019-09-03 19:43:58,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 19:43:58,769 INFO L168 Benchmark]: Toolchain (without parser) took 153881.62 ms. Allocated memory was 133.7 MB in the beginning and 257.4 MB in the end (delta: 123.7 MB). Free memory was 88.2 MB in the beginning and 137.5 MB in the end (delta: -49.3 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:43:58,770 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory was 106.8 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-03 19:43:58,770 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.66 ms. Allocated memory is still 133.7 MB. Free memory was 87.9 MB in the beginning and 78.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-09-03 19:43:58,771 INFO L168 Benchmark]: Boogie Preprocessor took 104.57 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 78.3 MB in the beginning and 176.8 MB in the end (delta: -98.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. [2019-09-03 19:43:58,772 INFO L168 Benchmark]: RCFGBuilder took 205.58 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 166.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-03 19:43:58,773 INFO L168 Benchmark]: TraceAbstraction took 153321.47 ms. Allocated memory was 200.3 MB in the beginning and 257.4 MB in the end (delta: 57.1 MB). Free memory was 165.9 MB in the beginning and 137.5 MB in the end (delta: 28.4 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2019-09-03 19:43:58,777 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.20 ms. Allocated memory is still 133.7 MB. Free memory was 106.8 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 242.66 ms. Allocated memory is still 133.7 MB. Free memory was 87.9 MB in the beginning and 78.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.57 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 78.3 MB in the beginning and 176.8 MB in the end (delta: -98.5 MB). Peak memory consumption was 16.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 205.58 ms. Allocated memory is still 200.3 MB. Free memory was 176.8 MB in the beginning and 166.5 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 153321.47 ms. Allocated memory was 200.3 MB in the beginning and 257.4 MB in the end (delta: 57.1 MB). Free memory was 165.9 MB in the beginning and 137.5 MB in the end (delta: 28.4 MB). Peak memory consumption was 85.5 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: 14]: Loop Invariant Derived loop invariant: (((((((((((y % 2 == 0 && x <= 3) && -(y / 2) / -2 / 2 <= 1) && y / 2 % -2 == 0) && 3 <= x) && 1 <= -(y / 2) / -2 / 2) && 0 == -(y / 2) / -2 % 2) || (((((1 <= -y / -2 / 2 && y % -2 == 0) && 2 <= x) && -y / -2 % 2 == 0) && x <= 2) && -y / -2 / 2 <= 1)) || (((1 <= y && x <= 0) && y <= 1) && 0 <= x)) || ((((y / 2 <= 1 && y % 2 == 0) && x <= 1) && 1 <= x) && 1 <= y / 2)) || (((((((((y % -2 == 0 && 0 == -(-y / -2 / 2) / -2 % 2) && -y / -2 / 2 % -2 == 0) && -(-y / -2 / 2) / -2 / 2 % -2 == 0) && x <= 6) && -(-(-y / -2 / 2) / -2 / 2) / -2 % 2 == 0) && -y / -2 % 2 == 0) && 6 <= x) && -(-(-y / -2 / 2) / -2 / 2) / -2 / 2 <= 1) && 1 <= -(-(-y / -2 / 2) / -2 / 2) / -2 / 2)) || ((((((((-(-(y / 2) / -2 / 2) / -2 % 2 == 0 && y % 2 == 0) && -(y / 2) / -2 / 2 % -2 == 0) && 1 <= -(-(y / 2) / -2 / 2) / -2 / 2) && 5 <= x) && y / 2 % -2 == 0) && 0 == -(y / 2) / -2 % 2) && -(-(y / 2) / -2 / 2) / -2 / 2 <= 1) && x <= 5)) || (((((((-(-y / -2 / 2) / -2 / 2 <= 1 && y % -2 == 0) && 0 == -(-y / -2 / 2) / -2 % 2) && 4 <= x) && -y / -2 / 2 % -2 == 0) && -y / -2 % 2 == 0) && x <= 4) && 1 <= -(-y / -2 / 2) / -2 / 2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 153.2s OverallTime, 8 OverallIterations, 8 TraceHistogramMax, 56.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 2 SDslu, 290 SDs, 0 SdLazy, 263 SolverSat, 22 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 34.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 116.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=7, 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.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 15 PreInvPairs, 24 NumberOfFragments, 435 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 654 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 94.8s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 193 ConstructedInterpolants, 2 QuantifiedInterpolants, 24290 SizeOfPredicates, 7 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 15 InterpolantComputations, 1 PerfectInterpolantSequences, 30/184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...