java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 11:55:14,885 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 11:55:14,887 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 11:55:14,899 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 11:55:14,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 11:55:14,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 11:55:14,902 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 11:55:14,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 11:55:14,905 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 11:55:14,906 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 11:55:14,907 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 11:55:14,907 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 11:55:14,908 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 11:55:14,909 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 11:55:14,910 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 11:55:14,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 11:55:14,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 11:55:14,914 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 11:55:14,916 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 11:55:14,918 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 11:55:14,919 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 11:55:14,920 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 11:55:14,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 11:55:14,923 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 11:55:14,923 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 11:55:14,924 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 11:55:14,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 11:55:14,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 11:55:14,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 11:55:14,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 11:55:14,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 11:55:14,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 11:55:14,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 11:55:14,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 11:55:14,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 11:55:14,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 11:55:14,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-24 11:55:14,960 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 11:55:14,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 11:55:14,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 11:55:14,961 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 11:55:14,962 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 11:55:14,962 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 11:55:14,962 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 11:55:14,962 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 11:55:14,963 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 11:55:14,964 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 11:55:14,964 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 11:55:14,964 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 11:55:14,965 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 11:55:14,965 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 11:55:14,965 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 11:55:14,965 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 11:55:14,965 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 11:55:14,967 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 11:55:14,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 11:55:14,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 11:55:14,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 11:55:14,967 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 11:55:14,968 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 11:55:14,968 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 11:55:14,968 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 11:55:14,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 11:55:14,968 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 11:55:14,969 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 11:55:15,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 11:55:15,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 11:55:15,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 11:55:15,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 11:55:15,059 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 11:55:15,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-10-24 11:55:15,118 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2a34b8eb5/3791ad8a6a1b4904b50c61a7949980bd/FLAG85e5b5274 [2018-10-24 11:55:15,641 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 11:55:15,642 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-10-24 11:55:15,648 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2a34b8eb5/3791ad8a6a1b4904b50c61a7949980bd/FLAG85e5b5274 [2018-10-24 11:55:15,661 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/2a34b8eb5/3791ad8a6a1b4904b50c61a7949980bd [2018-10-24 11:55:15,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 11:55:15,671 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 11:55:15,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 11:55:15,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 11:55:15,676 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 11:55:15,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb9bc50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15, skipping insertion in model container [2018-10-24 11:55:15,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 11:55:15,710 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 11:55:15,885 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:55:15,889 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 11:55:15,911 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 11:55:15,932 INFO L193 MainTranslator]: Completed translation [2018-10-24 11:55:15,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15 WrapperNode [2018-10-24 11:55:15,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 11:55:15,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 11:55:15,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 11:55:15,934 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 11:55:15,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 11:55:15,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 11:55:15,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 11:55:15,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 11:55:15,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,982 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... [2018-10-24 11:55:15,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 11:55:15,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 11:55:15,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 11:55:15,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 11:55:16,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:55:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 11:55:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 11:55:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-24 11:55:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 11:55:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 11:55:16,512 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 11:55:16,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:55:16 BoogieIcfgContainer [2018-10-24 11:55:16,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 11:55:16,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 11:55:16,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 11:55:16,517 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 11:55:16,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:55:15" (1/3) ... [2018-10-24 11:55:16,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9a085c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:55:16, skipping insertion in model container [2018-10-24 11:55:16,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:55:15" (2/3) ... [2018-10-24 11:55:16,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9a085c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:55:16, skipping insertion in model container [2018-10-24 11:55:16,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:55:16" (3/3) ... [2018-10-24 11:55:16,521 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-10-24 11:55:16,532 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 11:55:16,541 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 11:55:16,558 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 11:55:16,588 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 11:55:16,589 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 11:55:16,589 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 11:55:16,589 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 11:55:16,589 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 11:55:16,589 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 11:55:16,589 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 11:55:16,590 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 11:55:16,590 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 11:55:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-10-24 11:55:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-24 11:55:16,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:55:16,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:55:16,615 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:55:16,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:55:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 152184704, now seen corresponding path program 1 times [2018-10-24 11:55:16,626 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:55:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:55:16,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:16,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:55:16,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:55:16,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:55:16,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:55:16,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-24 11:55:16,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-24 11:55:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-24 11:55:16,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-24 11:55:16,910 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 5 states. [2018-10-24 11:55:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:55:17,481 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2018-10-24 11:55:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 11:55:17,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-24 11:55:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:55:17,494 INFO L225 Difference]: With dead ends: 69 [2018-10-24 11:55:17,494 INFO L226 Difference]: Without dead ends: 38 [2018-10-24 11:55:17,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-24 11:55:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-24 11:55:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-10-24 11:55:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-24 11:55:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-10-24 11:55:17,539 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 8 [2018-10-24 11:55:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:55:17,539 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-10-24 11:55:17,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-24 11:55:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-10-24 11:55:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-24 11:55:17,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:55:17,541 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:55:17,541 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:55:17,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:55:17,542 INFO L82 PathProgramCache]: Analyzing trace with hash 458111371, now seen corresponding path program 1 times [2018-10-24 11:55:17,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:55:17,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:55:17,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:55:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:55:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:55:17,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:55:17,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 11:55:17,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 11:55:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 11:55:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 11:55:17,612 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-10-24 11:55:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:55:17,628 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-10-24 11:55:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 11:55:17,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-24 11:55:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:55:17,630 INFO L225 Difference]: With dead ends: 44 [2018-10-24 11:55:17,630 INFO L226 Difference]: Without dead ends: 31 [2018-10-24 11:55:17,636 INFO L605 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 [2018-10-24 11:55:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-24 11:55:17,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-24 11:55:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-24 11:55:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-10-24 11:55:17,648 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 13 [2018-10-24 11:55:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:55:17,648 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-10-24 11:55:17,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 11:55:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-10-24 11:55:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-24 11:55:17,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:55:17,651 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:55:17,652 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:55:17,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:55:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1957151887, now seen corresponding path program 1 times [2018-10-24 11:55:17,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:55:17,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:55:17,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:17,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:55:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:55:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:55:17,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:55:17,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-24 11:55:17,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 11:55:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 11:55:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-24 11:55:17,996 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 8 states. [2018-10-24 11:55:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:55:18,333 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-10-24 11:55:18,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-24 11:55:18,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-10-24 11:55:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:55:18,335 INFO L225 Difference]: With dead ends: 49 [2018-10-24 11:55:18,335 INFO L226 Difference]: Without dead ends: 47 [2018-10-24 11:55:18,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-10-24 11:55:18,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-24 11:55:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2018-10-24 11:55:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-24 11:55:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-24 11:55:18,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-10-24 11:55:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:55:18,344 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-24 11:55:18,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 11:55:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-24 11:55:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-24 11:55:18,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:55:18,345 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:55:18,346 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:55:18,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:55:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash 471594042, now seen corresponding path program 1 times [2018-10-24 11:55:18,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:55:18,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:55:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:18,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:55:18,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:55:21,167 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-10-24 11:55:21,481 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-10-24 11:55:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 11:55:21,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 11:55:21,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-24 11:55:21,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-24 11:55:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-24 11:55:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-10-24 11:55:21,635 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-10-24 11:55:26,844 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (div (+ c_ULTIMATE.start_main_~index2~0 4294867297) 4294967296))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0.base|)) (.cse0 (+ (* 4294967296 .cse8) c_ULTIMATE.start_main_~index1~0)) (.cse1 (* 4294967296 (div (+ c_ULTIMATE.start_main_~index1~0 (- 1)) 4294967296)))) (and (<= .cse0 (+ .cse1 c_ULTIMATE.start_main_~index2~0 1)) (let ((.cse2 (select .cse4 (+ (* 4 c_ULTIMATE.start_main_~index2~0) (+ (* (- 17179869184) (div c_ULTIMATE.start_main_~index2~0 4294967296)) |c_ULTIMATE.start_main_~#array~0.offset|))))) (<= .cse2 (let ((.cse3 (select .cse4 (+ (* 4 c_ULTIMATE.start_main_~index1~0) (+ |c_ULTIMATE.start_main_~#array~0.offset| (* (- 17179869184) (div c_ULTIMATE.start_main_~index1~0 4294967296))))))) (+ .cse3 (* 4294967296 (div (+ (- .cse3) .cse2) 4294967296)))))) (or (let ((.cse7 (* (- 4294967296) .cse8))) (let ((.cse6 (select .cse4 (+ (* 4 (+ c_ULTIMATE.start_main_~index2~0 (+ .cse7 (+ .cse1 (* (- 4294967296) (div (+ c_ULTIMATE.start_main_~index1~0 4294867295) 4294967296)))))) |c_ULTIMATE.start_main_~#array~0.offset|)))) (<= (let ((.cse5 (select .cse4 (+ (* 4 (+ c_ULTIMATE.start_main_~index2~0 (+ .cse7 1))) |c_ULTIMATE.start_main_~#array~0.offset|)))) (+ .cse5 (* 4294967296 (div (+ (- .cse5) (+ .cse6 4294967295)) 4294967296)))) .cse6))) (<= .cse0 (+ .cse1 c_ULTIMATE.start_main_~index2~0)))))) is different from false [2018-10-24 11:55:29,836 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 59 DAG size of output: 23 [2018-10-24 11:55:43,624 WARN L179 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 66 DAG size of output: 35 [2018-10-24 11:55:45,671 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~index2~0 4294967296)) (.cse7 (div (+ c_ULTIMATE.start_main_~index2~0 4294867297) 4294967296))) (let ((.cse0 (+ (* 4294967296 .cse7) c_ULTIMATE.start_main_~index1~0)) (.cse1 (* 4294967296 (div (+ c_ULTIMATE.start_main_~index1~0 (- 1)) 4294967296))) (.cse3 (div c_ULTIMATE.start_main_~index1~0 4294967296)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array~0.base|)) (.cse8 (* 4294967296 .cse9))) (and (<= .cse0 (+ .cse1 c_ULTIMATE.start_main_~index2~0 1)) (= |c_ULTIMATE.start_main_#t~mem3| (select .cse2 (+ |c_ULTIMATE.start_main_~#array~0.offset| (* 4 c_ULTIMATE.start_main_~index1~0) (* (- 17179869184) .cse3)))) (or (let ((.cse6 (* (- 4294967296) .cse7))) (let ((.cse5 (select .cse2 (+ (* 4 (+ c_ULTIMATE.start_main_~index2~0 (+ .cse6 (+ .cse1 (* (- 4294967296) (div (+ c_ULTIMATE.start_main_~index1~0 4294867295) 4294967296)))))) |c_ULTIMATE.start_main_~#array~0.offset|)))) (<= (let ((.cse4 (select .cse2 (+ (* 4 (+ c_ULTIMATE.start_main_~index2~0 (+ .cse6 1))) |c_ULTIMATE.start_main_~#array~0.offset|)))) (+ .cse4 (* 4294967296 (div (+ (- .cse4) (+ .cse5 4294967295)) 4294967296)))) .cse5))) (<= .cse0 (+ .cse1 c_ULTIMATE.start_main_~index2~0))) (<= (+ .cse8 c_ULTIMATE.start_main_~index1~0 1) (+ (* 4294967296 .cse3) c_ULTIMATE.start_main_~index2~0)) (= |c_ULTIMATE.start_main_#t~mem4| (select .cse2 (+ |c_ULTIMATE.start_main_~#array~0.offset| (* 4 c_ULTIMATE.start_main_~index2~0) (* (- 17179869184) .cse9)))) (<= c_ULTIMATE.start_main_~index2~0 (+ .cse8 99999))))) is different from false [2018-10-24 11:55:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:55:45,674 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-10-24 11:55:45,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-24 11:55:45,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-10-24 11:55:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:55:45,675 INFO L225 Difference]: With dead ends: 43 [2018-10-24 11:55:45,675 INFO L226 Difference]: Without dead ends: 41 [2018-10-24 11:55:45,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=69, Invalid=240, Unknown=5, NotChecked=66, Total=380 [2018-10-24 11:55:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-24 11:55:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2018-10-24 11:55:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-24 11:55:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-24 11:55:45,685 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 23 [2018-10-24 11:55:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:55:45,685 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-24 11:55:45,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-24 11:55:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-24 11:55:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-24 11:55:45,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 11:55:45,688 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 11:55:45,689 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 11:55:45,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 11:55:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash 780909629, now seen corresponding path program 1 times [2018-10-24 11:55:45,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 11:55:45,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 11:55:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:45,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:55:45,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 11:55:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:55:46,027 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-10-24 11:55:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 11:55:47,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 11:55:47,680 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-24 11:55:47,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 11:55:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 11:55:47,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 11:55:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-24 11:55:49,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-24 11:55:49,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-10-24 11:55:49,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 11:55:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 11:55:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=27, Unknown=1, NotChecked=0, Total=42 [2018-10-24 11:55:49,890 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 7 states. [2018-10-24 11:55:54,267 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 22 [2018-10-24 11:55:56,152 WARN L179 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2018-10-24 11:56:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 11:56:04,144 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-10-24 11:56:04,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 11:56:04,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-10-24 11:56:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 11:56:04,147 INFO L225 Difference]: With dead ends: 43 [2018-10-24 11:56:04,148 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 11:56:04,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=27, Invalid=44, Unknown=1, NotChecked=0, Total=72 [2018-10-24 11:56:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 11:56:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 11:56:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 11:56:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 11:56:04,150 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-10-24 11:56:04,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 11:56:04,150 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 11:56:04,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 11:56:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 11:56:04,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 11:56:04,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 11:56:09,079 WARN L179 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2018-10-24 11:56:13,352 WARN L179 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2018-10-24 11:56:28,046 WARN L179 SmtUtils]: Spent 14.69 s on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-10-24 11:56:32,362 WARN L179 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 60 [2018-10-24 11:56:32,365 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-10-24 11:56:32,366 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 11:56:32,366 INFO L425 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2018-10-24 11:56:32,366 INFO L425 ceAbstractionStarter]: For program point L31-1(lines 31 37) no Hoare annotation was computed. [2018-10-24 11:56:32,367 INFO L421 ceAbstractionStarter]: At program point L31-3(lines 31 37) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~index1~0 (+ (* 4294967296 (div ULTIMATE.start_main_~index1~0 4294967296)) 99999)) (= ULTIMATE.start_main_~loop_entered~0 0) (<= ULTIMATE.start_main_~index2~0 (+ (* 4294967296 (div ULTIMATE.start_main_~index2~0 4294967296)) 99999))) (let ((.cse6 (div (+ ULTIMATE.start_main_~index2~0 4294867297) 4294967296))) (let ((.cse0 (* 4294967296 .cse6))) (and (<= (+ (* 4294967296 (div (+ (- ULTIMATE.start_main_~index1~0) (+ .cse0 4294967296)) 4294967296)) ULTIMATE.start_main_~index1~0) (+ ULTIMATE.start_main_~index2~0 1)) (let ((.cse5 (* 4294967296 (div (+ ULTIMATE.start_main_~index1~0 (- 1)) 4294967296)))) (or (let ((.cse3 (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|)) (.cse4 (* (- 4294967296) .cse6))) (let ((.cse2 (select .cse3 (+ (* 4 (+ ULTIMATE.start_main_~index2~0 (+ .cse4 (+ .cse5 (* (- 4294967296) (div (+ ULTIMATE.start_main_~index1~0 4294867295) 4294967296)))))) |ULTIMATE.start_main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* 4 (+ ULTIMATE.start_main_~index2~0 (+ .cse4 1))) |ULTIMATE.start_main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ (- .cse1) (+ .cse2 4294967295)) 4294967296)))) .cse2))) (<= (+ .cse0 ULTIMATE.start_main_~index1~0) (+ .cse5 ULTIMATE.start_main_~index2~0)))))))) [2018-10-24 11:56:32,367 INFO L425 ceAbstractionStarter]: For program point L31-4(lines 20 47) no Hoare annotation was computed. [2018-10-24 11:56:32,367 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 47) no Hoare annotation was computed. [2018-10-24 11:56:32,367 INFO L425 ceAbstractionStarter]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2018-10-24 11:56:32,368 INFO L421 ceAbstractionStarter]: At program point L40-3(lines 40 44) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~index1~0 4294967296)) (.cse4 (div ULTIMATE.start_main_~index2~0 4294967296))) (or (and (let ((.cse2 (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|))) (let ((.cse0 (select .cse2 (+ (* 4 ULTIMATE.start_main_~index2~0) (+ (* (- 17179869184) .cse4) |ULTIMATE.start_main_~#array~0.offset|))))) (<= .cse0 (let ((.cse1 (select .cse2 (+ (* 4 ULTIMATE.start_main_~index1~0) (+ |ULTIMATE.start_main_~#array~0.offset| (* (- 17179869184) .cse3)))))) (+ .cse1 (* 4294967296 (div (+ (- .cse1) .cse0) 4294967296))))))) (<= (+ (* 4294967296 (div (+ (- ULTIMATE.start_main_~index1~0) (+ (* 4294967296 (div (+ ULTIMATE.start_main_~index2~0 4294867297) 4294967296)) 4294967296)) 4294967296)) ULTIMATE.start_main_~index1~0) (+ ULTIMATE.start_main_~index2~0 1))) (let ((.cse5 (* 4294967296 .cse4))) (and (<= (+ .cse5 ULTIMATE.start_main_~index1~0 1) (+ (* 4294967296 .cse3) ULTIMATE.start_main_~index2~0)) (<= ULTIMATE.start_main_~index2~0 (+ .cse5 99999)))))) [2018-10-24 11:56:32,368 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div ULTIMATE.start_main_~index2~0 4294967296)))) (and (or (<= ULTIMATE.start_main_~index2~0 (+ .cse0 99998)) (and (= ULTIMATE.start_main_~loop_entered~0 0) (<= ULTIMATE.start_main_~index2~0 (+ .cse0 99999)))) (<= (+ .cse0 ULTIMATE.start_main_~index1~0 1) (+ (* 4294967296 (div ULTIMATE.start_main_~index1~0 4294967296)) ULTIMATE.start_main_~index2~0)))) [2018-10-24 11:56:32,368 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 11:56:32,368 INFO L425 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-10-24 11:56:32,368 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 11:56:32,369 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 11:56:32,369 INFO L425 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-10-24 11:56:32,369 INFO L425 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-10-24 11:56:32,369 INFO L421 ceAbstractionStarter]: At program point L41-2(line 41) the Hoare annotation is: (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#array~0.base|))) (let ((.cse0 (+ ULTIMATE.start_main_~index2~0 1)) (.cse1 (- |ULTIMATE.start_main_#t~mem7|)) (.cse2 (select .cse4 (+ (* 4 ULTIMATE.start_main_~index2~0) (+ (* (- 17179869184) (div ULTIMATE.start_main_~index2~0 4294967296)) |ULTIMATE.start_main_~#array~0.offset|))))) (and (< (mod (+ ULTIMATE.start_main_~index1~0 4294967295) 4294967296) (mod .cse0 4294967296)) (<= |ULTIMATE.start_main_#t~mem8| (+ (* 4294967296 (div (+ |ULTIMATE.start_main_#t~mem8| .cse1) 4294967296)) |ULTIMATE.start_main_#t~mem7|)) (<= .cse2 (let ((.cse3 (select .cse4 (+ (* 4 ULTIMATE.start_main_~index1~0) (+ |ULTIMATE.start_main_~#array~0.offset| (* (- 17179869184) (div ULTIMATE.start_main_~index1~0 4294967296))))))) (+ .cse3 (* 4294967296 (div (+ (- .cse3) .cse2) 4294967296))))) (<= (+ (* 4294967296 (div (+ (- ULTIMATE.start_main_~index1~0) (+ (* 4294967296 (div (+ ULTIMATE.start_main_~index2~0 4294867297) 4294967296)) 4294967296)) 4294967296)) ULTIMATE.start_main_~index1~0) .cse0) (<= (+ (* 4294967296 (div (+ .cse1 (+ .cse2 4294967295)) 4294967296)) |ULTIMATE.start_main_#t~mem7|) .cse2)))) [2018-10-24 11:56:32,369 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-10-24 11:56:32,369 INFO L425 ceAbstractionStarter]: For program point L41-3(line 41) no Hoare annotation was computed. [2018-10-24 11:56:32,370 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-10-24 11:56:32,370 INFO L425 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-10-24 11:56:32,370 INFO L425 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-10-24 11:56:32,370 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-10-24 11:56:32,370 INFO L425 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-10-24 11:56:32,370 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-10-24 11:56:32,378 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,379 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,380 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,387 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,388 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,392 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,393 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,394 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,396 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,397 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:56:32 BoogieIcfgContainer [2018-10-24 11:56:32,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 11:56:32,400 INFO L168 Benchmark]: Toolchain (without parser) took 76729.94 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -560.3 MB). Peak memory consumption was 198.8 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:32,402 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:32,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.60 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:32,403 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.09 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:32,404 INFO L168 Benchmark]: Boogie Preprocessor took 24.65 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 11:56:32,405 INFO L168 Benchmark]: RCFGBuilder took 514.29 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:32,406 INFO L168 Benchmark]: TraceAbstraction took 75885.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 229.1 MB). Peak memory consumption was 229.1 MB. Max. memory is 7.1 GB. [2018-10-24 11:56:32,411 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 260.60 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.09 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.65 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 514.29 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 759.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -800.0 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75885.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 229.1 MB). Peak memory consumption was 229.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 40]: Loop Invariant [2018-10-24 11:56:32,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,423 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,423 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,424 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,424 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,425 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (unknown-#memory_int-unknown[array][4 * index2 + (-17179869184 * (index2 / 4294967296) + array)] <= unknown-#memory_int-unknown[array][4 * index1 + (array + -17179869184 * (index1 / 4294967296))] + 4294967296 * ((-unknown-#memory_int-unknown[array][4 * index1 + (array + -17179869184 * (index1 / 4294967296))] + unknown-#memory_int-unknown[array][4 * index2 + (-17179869184 * (index2 / 4294967296) + array)]) / 4294967296) && 4294967296 * ((-index1 + (4294967296 * ((index2 + 4294867297) / 4294967296) + 4294967296)) / 4294967296) + index1 <= index2 + 1) || (4294967296 * (index2 / 4294967296) + index1 + 1 <= 4294967296 * (index1 / 4294967296) + index2 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) - InvariantResult [Line: 31]: Loop Invariant [2018-10-24 11:56:32,426 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,427 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-24 11:56:32,429 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && loop_entered == 0) && index2 <= 4294967296 * (index2 / 4294967296) + 99999) || (4294967296 * ((-index1 + (4294967296 * ((index2 + 4294867297) / 4294967296) + 4294967296)) / 4294967296) + index1 <= index2 + 1 && (unknown-#memory_int-unknown[array][4 * (index2 + (-4294967296 * ((index2 + 4294867297) / 4294967296) + 1)) + array] + 4294967296 * ((-unknown-#memory_int-unknown[array][4 * (index2 + (-4294967296 * ((index2 + 4294867297) / 4294967296) + 1)) + array] + (unknown-#memory_int-unknown[array][4 * (index2 + (-4294967296 * ((index2 + 4294867297) / 4294967296) + (4294967296 * ((index1 + -1) / 4294967296) + -4294967296 * ((index1 + 4294867295) / 4294967296)))) + array] + 4294967295)) / 4294967296) <= unknown-#memory_int-unknown[array][4 * (index2 + (-4294967296 * ((index2 + 4294867297) / 4294967296) + (4294967296 * ((index1 + -1) / 4294967296) + -4294967296 * ((index1 + 4294867295) / 4294967296)))) + array] || 4294967296 * ((index2 + 4294867297) / 4294967296) + index1 <= 4294967296 * ((index1 + -1) / 4294967296) + index2)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. SAFE Result, 75.7s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 39.2s AutomataDifference, 0.0s DeadEndRemovalTime, 28.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 93 SDslu, 219 SDs, 0 SdLazy, 279 SolverSat, 30 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=4, 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, 5 MinimizatonAttempts, 38 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 495 HoareAnnotationTreeSize, 11 FomulaSimplifications, 132 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 321 FormulaSimplificationTreeSizeReductionInter, 28.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 40245 SizeOfPredicates, 2 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 35/39 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...