java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:42,894 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:42,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:42,912 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:42,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:42,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:42,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:42,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:42,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:42,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:42,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:42,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:42,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:42,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:42,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:42,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:42,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:42,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:42,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:42,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:42,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:42,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:42,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:42,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:42,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:42,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:42,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:42,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:42,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:42,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:42,940 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:42,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:42,941 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:42,941 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:42,942 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:42,943 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:42,943 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:08:42,958 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:42,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:42,959 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:42,959 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:42,960 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:42,960 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:42,960 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:42,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:42,961 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:42,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:42,961 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:42,961 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:42,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:42,961 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:42,962 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:42,962 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:42,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:42,962 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:42,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:42,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:42,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:42,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:42,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:42,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:42,964 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:42,964 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:42,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:42,964 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:42,964 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:42,965 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:42,965 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:43,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:43,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:43,032 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:43,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:43,034 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:43,035 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-23 13:08:43,097 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b05d188/d2db51277bd748aa8900cb2ec2618c6a/FLAG0c97833d8 [2018-11-23 13:08:43,494 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:43,495 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-23 13:08:43,500 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b05d188/d2db51277bd748aa8900cb2ec2618c6a/FLAG0c97833d8 [2018-11-23 13:08:43,883 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79b05d188/d2db51277bd748aa8900cb2ec2618c6a [2018-11-23 13:08:43,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:43,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:43,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:43,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:43,899 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:43,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717d65bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:43, skipping insertion in model container [2018-11-23 13:08:43,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:43" (1/1) ... [2018-11-23 13:08:43,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:43,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:44,192 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:44,197 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:44,228 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:44,259 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:44,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44 WrapperNode [2018-11-23 13:08:44,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:44,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:44,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:44,261 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:44,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,284 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:44,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:44,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:44,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:44,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (1/1) ... [2018-11-23 13:08:44,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:44,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:44,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:44,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:44,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (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 [2018-11-23 13:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:44,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:44,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:44,440 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:44,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:44,441 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:44,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:08:44,894 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:44,895 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 13:08:44,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:44 BoogieIcfgContainer [2018-11-23 13:08:44,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:44,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:44,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:44,900 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:44,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:43" (1/3) ... [2018-11-23 13:08:44,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a779d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:44, skipping insertion in model container [2018-11-23 13:08:44,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:44" (2/3) ... [2018-11-23 13:08:44,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a779d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:44, skipping insertion in model container [2018-11-23 13:08:44,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:44" (3/3) ... [2018-11-23 13:08:44,903 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call3_true-termination.i [2018-11-23 13:08:44,913 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:44,920 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:44,938 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:44,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:44,971 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:44,971 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:44,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:44,972 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:44,972 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:44,972 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:44,972 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:44,972 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 13:08:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:08:44,996 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:44,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:44,999 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:45,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1378298279, now seen corresponding path program 1 times [2018-11-23 13:08:45,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:45,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:45,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:45,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 13:08:45,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {27#true} is VALID [2018-11-23 13:08:45,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 13:08:45,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #54#return; {27#true} is VALID [2018-11-23 13:08:45,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2018-11-23 13:08:45,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {27#true} is VALID [2018-11-23 13:08:45,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 13:08:45,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} ~index~0 := 0; {28#false} is VALID [2018-11-23 13:08:45,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {28#false} is VALID [2018-11-23 13:08:45,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume #t~short4; {28#false} is VALID [2018-11-23 13:08:45,157 INFO L256 TraceCheckUtils]: 10: Hoare triple {28#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {28#false} is VALID [2018-11-23 13:08:45,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 13:08:45,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2018-11-23 13:08:45,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 13:08:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:45,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:45,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:08:45,168 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:08:45,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:45,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:08:45,261 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:45,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:08:45,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:08:45,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:08:45,272 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 13:08:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,445 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-11-23 13:08:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:08:45,445 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 13:08:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 13:08:45,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:45,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 13:08:45,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-23 13:08:45,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:45,754 INFO L225 Difference]: With dead ends: 41 [2018-11-23 13:08:45,754 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:08:45,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:08:45,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:08:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:08:45,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:45,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,804 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,804 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,808 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 13:08:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 13:08:45,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:45,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:45,809 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,809 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 13:08:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:45,812 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 13:08:45,813 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 13:08:45,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:45,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:45,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:45,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:08:45,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 13:08:45,818 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2018-11-23 13:08:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:45,818 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 13:08:45,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:08:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 13:08:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:08:45,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:45,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:45,820 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:45,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:45,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1297975765, now seen corresponding path program 1 times [2018-11-23 13:08:45,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:45,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:45,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:45,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:46,013 INFO L256 TraceCheckUtils]: 0: Hoare triple {148#true} call ULTIMATE.init(); {148#true} is VALID [2018-11-23 13:08:46,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {148#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {148#true} is VALID [2018-11-23 13:08:46,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {148#true} assume true; {148#true} is VALID [2018-11-23 13:08:46,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {148#true} {148#true} #54#return; {148#true} is VALID [2018-11-23 13:08:46,015 INFO L256 TraceCheckUtils]: 4: Hoare triple {148#true} call #t~ret5 := main(); {148#true} is VALID [2018-11-23 13:08:46,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {148#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {148#true} is VALID [2018-11-23 13:08:46,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {148#true} assume !(~index~0 % 4294967296 < 10000); {148#true} is VALID [2018-11-23 13:08:46,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {148#true} ~index~0 := 0; {148#true} is VALID [2018-11-23 13:08:46,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {148#true} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {148#true} is VALID [2018-11-23 13:08:46,029 INFO L273 TraceCheckUtils]: 9: Hoare triple {148#true} assume #t~short4; {150#|main_#t~short4|} is VALID [2018-11-23 13:08:46,044 INFO L256 TraceCheckUtils]: 10: Hoare triple {150#|main_#t~short4|} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {151#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:08:46,053 INFO L273 TraceCheckUtils]: 11: Hoare triple {151#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {152#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:08:46,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {152#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {149#false} is VALID [2018-11-23 13:08:46,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {149#false} assume !false; {149#false} is VALID [2018-11-23 13:08:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:46,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:46,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:08:46,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:08:46,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:46,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:08:46,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:46,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:08:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:08:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:08:46,119 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2018-11-23 13:08:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:46,746 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 13:08:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:08:46,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 13:08:46,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:08:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:08:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2018-11-23 13:08:46,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2018-11-23 13:08:47,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,098 INFO L225 Difference]: With dead ends: 27 [2018-11-23 13:08:47,098 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:08:47,099 INFO L631 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-11-23 13:08:47,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:08:47,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 13:08:47,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:47,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2018-11-23 13:08:47,114 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2018-11-23 13:08:47,114 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2018-11-23 13:08:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,117 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:08:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:08:47,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,118 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2018-11-23 13:08:47,118 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2018-11-23 13:08:47,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,121 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:08:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:08:47,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:47,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:08:47,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 13:08:47,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-23 13:08:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:47,125 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:08:47,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:08:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:08:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 13:08:47,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:47,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:47,127 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:47,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1296128723, now seen corresponding path program 1 times [2018-11-23 13:08:47,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:47,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:47,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {278#true} call ULTIMATE.init(); {278#true} is VALID [2018-11-23 13:08:47,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {278#true} is VALID [2018-11-23 13:08:47,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {278#true} assume true; {278#true} is VALID [2018-11-23 13:08:47,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} #54#return; {278#true} is VALID [2018-11-23 13:08:47,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {278#true} call #t~ret5 := main(); {278#true} is VALID [2018-11-23 13:08:47,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {280#(= main_~index~0 0)} is VALID [2018-11-23 13:08:47,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {280#(= main_~index~0 0)} assume !(~index~0 % 4294967296 < 10000); {279#false} is VALID [2018-11-23 13:08:47,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {279#false} ~index~0 := 0; {279#false} is VALID [2018-11-23 13:08:47,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {279#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {279#false} is VALID [2018-11-23 13:08:47,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {279#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {279#false} is VALID [2018-11-23 13:08:47,201 INFO L256 TraceCheckUtils]: 10: Hoare triple {279#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {279#false} is VALID [2018-11-23 13:08:47,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {279#false} ~cond := #in~cond; {279#false} is VALID [2018-11-23 13:08:47,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {279#false} assume 0 == ~cond; {279#false} is VALID [2018-11-23 13:08:47,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {279#false} assume !false; {279#false} is VALID [2018-11-23 13:08:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:47,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:47,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:08:47,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:08:47,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:47,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:08:47,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:08:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:08:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:08:47,233 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 3 states. [2018-11-23 13:08:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,398 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 13:08:47,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:08:47,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 13:08:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:47,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-23 13:08:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:08:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-23 13:08:47,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-23 13:08:47,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:47,504 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:08:47,504 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:08:47,505 INFO L631 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-11-23 13:08:47,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:08:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-11-23 13:08:47,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:47,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 25 states. [2018-11-23 13:08:47,535 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 25 states. [2018-11-23 13:08:47,536 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 25 states. [2018-11-23 13:08:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,542 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:08:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:08:47,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,543 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 31 states. [2018-11-23 13:08:47,543 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 31 states. [2018-11-23 13:08:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:47,546 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 13:08:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 13:08:47,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:47,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:47,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:47,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:08:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 13:08:47,550 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 14 [2018-11-23 13:08:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:47,551 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 13:08:47,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:08:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:08:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 13:08:47,552 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:47,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:47,552 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:47,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1388961987, now seen corresponding path program 1 times [2018-11-23 13:08:47,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:47,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:47,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:47,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {448#true} call ULTIMATE.init(); {448#true} is VALID [2018-11-23 13:08:47,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {448#true} is VALID [2018-11-23 13:08:47,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {448#true} assume true; {448#true} is VALID [2018-11-23 13:08:47,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {448#true} {448#true} #54#return; {448#true} is VALID [2018-11-23 13:08:47,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {448#true} call #t~ret5 := main(); {448#true} is VALID [2018-11-23 13:08:47,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {448#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {450#(= main_~index~0 0)} is VALID [2018-11-23 13:08:47,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {450#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {451#(and (<= main_~index~0 1) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:47,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {451#(and (<= main_~index~0 1) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {449#false} is VALID [2018-11-23 13:08:47,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {449#false} ~index~0 := 0; {449#false} is VALID [2018-11-23 13:08:47,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {449#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {449#false} is VALID [2018-11-23 13:08:47,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {449#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {449#false} is VALID [2018-11-23 13:08:47,723 INFO L256 TraceCheckUtils]: 11: Hoare triple {449#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {449#false} is VALID [2018-11-23 13:08:47,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {449#false} ~cond := #in~cond; {449#false} is VALID [2018-11-23 13:08:47,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {449#false} assume 0 == ~cond; {449#false} is VALID [2018-11-23 13:08:47,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {449#false} assume !false; {449#false} is VALID [2018-11-23 13:08:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:47,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:47,725 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:47,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:47,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:47,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:08:47,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:08:47,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:08:47,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:47,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:08:47,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 13:08:48,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {448#true} call ULTIMATE.init(); {448#true} is VALID [2018-11-23 13:08:48,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {448#true} is VALID [2018-11-23 13:08:48,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {448#true} assume true; {448#true} is VALID [2018-11-23 13:08:48,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {448#true} {448#true} #54#return; {448#true} is VALID [2018-11-23 13:08:48,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {448#true} call #t~ret5 := main(); {448#true} is VALID [2018-11-23 13:08:48,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {448#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {470#(and (= main_~tmp~0 0) (= 0 main_~index~0))} is VALID [2018-11-23 13:08:48,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {470#(and (= main_~tmp~0 0) (= 0 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {474#(= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2018-11-23 13:08:48,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} assume !(~index~0 % 4294967296 < 10000); {474#(= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} is VALID [2018-11-23 13:08:48,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {474#(= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|))} ~index~0 := 0; {481#(and (= 0 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:08:48,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#(and (= 0 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {485#|main_#t~short4|} is VALID [2018-11-23 13:08:48,233 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#|main_#t~short4|} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {449#false} is VALID [2018-11-23 13:08:48,233 INFO L256 TraceCheckUtils]: 11: Hoare triple {449#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {449#false} is VALID [2018-11-23 13:08:48,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {449#false} ~cond := #in~cond; {449#false} is VALID [2018-11-23 13:08:48,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {449#false} assume 0 == ~cond; {449#false} is VALID [2018-11-23 13:08:48,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {449#false} assume !false; {449#false} is VALID [2018-11-23 13:08:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:48,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:48,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-11-23 13:08:48,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 13:08:48,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:48,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:08:48,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:48,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:08:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:08:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:48,381 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-11-23 13:08:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:48,952 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2018-11-23 13:08:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:08:48,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 13:08:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-23 13:08:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-23 13:08:48,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2018-11-23 13:08:49,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:49,052 INFO L225 Difference]: With dead ends: 58 [2018-11-23 13:08:49,053 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:08:49,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:08:49,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:08:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-11-23 13:08:49,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:49,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 26 states. [2018-11-23 13:08:49,099 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 26 states. [2018-11-23 13:08:49,099 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 26 states. [2018-11-23 13:08:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:49,103 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 13:08:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 13:08:49,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:49,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:49,104 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 41 states. [2018-11-23 13:08:49,105 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 41 states. [2018-11-23 13:08:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:49,108 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 13:08:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 13:08:49,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:49,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:49,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:49,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:08:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 13:08:49,112 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 15 [2018-11-23 13:08:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 13:08:49,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:08:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:08:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:08:49,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:49,113 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:49,114 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:49,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash 28174125, now seen corresponding path program 2 times [2018-11-23 13:08:49,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:49,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:49,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-23 13:08:49,290 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-23 13:08:49,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-23 13:08:49,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #54#return; {707#true} is VALID [2018-11-23 13:08:49,291 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2018-11-23 13:08:49,291 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {709#(= main_~index~0 0)} is VALID [2018-11-23 13:08:49,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {709#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {710#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2018-11-23 13:08:49,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {710#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {711#(and (< 0 (+ (div main_~index~0 4294967296) 1)) (<= main_~index~0 2))} is VALID [2018-11-23 13:08:49,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {711#(and (< 0 (+ (div main_~index~0 4294967296) 1)) (<= main_~index~0 2))} assume !(~index~0 % 4294967296 < 10000); {708#false} is VALID [2018-11-23 13:08:49,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {708#false} ~index~0 := 0; {708#false} is VALID [2018-11-23 13:08:49,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {708#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {708#false} is VALID [2018-11-23 13:08:49,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {708#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {708#false} is VALID [2018-11-23 13:08:49,297 INFO L256 TraceCheckUtils]: 12: Hoare triple {708#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {708#false} is VALID [2018-11-23 13:08:49,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-23 13:08:49,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume 0 == ~cond; {708#false} is VALID [2018-11-23 13:08:49,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-23 13:08:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:49,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:49,300 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 [2018-11-23 13:08:49,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:08:49,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:08:49,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:49,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:49,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {707#true} call ULTIMATE.init(); {707#true} is VALID [2018-11-23 13:08:49,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {707#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {707#true} is VALID [2018-11-23 13:08:49,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {707#true} assume true; {707#true} is VALID [2018-11-23 13:08:49,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {707#true} {707#true} #54#return; {707#true} is VALID [2018-11-23 13:08:49,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {707#true} call #t~ret5 := main(); {707#true} is VALID [2018-11-23 13:08:49,417 INFO L273 TraceCheckUtils]: 5: Hoare triple {707#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {709#(= main_~index~0 0)} is VALID [2018-11-23 13:08:49,418 INFO L273 TraceCheckUtils]: 6: Hoare triple {709#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {710#(and (<= main_~index~0 1) (<= 1 main_~index~0))} is VALID [2018-11-23 13:08:49,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {710#(and (<= main_~index~0 1) (<= 1 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {736#(and (<= 2 main_~index~0) (<= main_~index~0 2))} is VALID [2018-11-23 13:08:49,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#(and (<= 2 main_~index~0) (<= main_~index~0 2))} assume !(~index~0 % 4294967296 < 10000); {708#false} is VALID [2018-11-23 13:08:49,420 INFO L273 TraceCheckUtils]: 9: Hoare triple {708#false} ~index~0 := 0; {708#false} is VALID [2018-11-23 13:08:49,421 INFO L273 TraceCheckUtils]: 10: Hoare triple {708#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {708#false} is VALID [2018-11-23 13:08:49,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {708#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {708#false} is VALID [2018-11-23 13:08:49,422 INFO L256 TraceCheckUtils]: 12: Hoare triple {708#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {708#false} is VALID [2018-11-23 13:08:49,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#false} ~cond := #in~cond; {708#false} is VALID [2018-11-23 13:08:49,422 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#false} assume 0 == ~cond; {708#false} is VALID [2018-11-23 13:08:49,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {708#false} assume !false; {708#false} is VALID [2018-11-23 13:08:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:49,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:49,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 13:08:49,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:08:49,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:49,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:08:49,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:49,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:08:49,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:08:49,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:49,472 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-23 13:08:49,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:49,945 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-11-23 13:08:49,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:08:49,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 13:08:49,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 13:08:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:08:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2018-11-23 13:08:49,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2018-11-23 13:08:50,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:50,160 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:08:50,160 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:08:50,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:08:50,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:08:50,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2018-11-23 13:08:50,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:50,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 27 states. [2018-11-23 13:08:50,206 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 27 states. [2018-11-23 13:08:50,206 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 27 states. [2018-11-23 13:08:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:50,211 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 13:08:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 13:08:50,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:50,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:50,212 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 45 states. [2018-11-23 13:08:50,213 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 45 states. [2018-11-23 13:08:50,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:50,216 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 13:08:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 13:08:50,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:50,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:50,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:50,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 13:08:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 13:08:50,220 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2018-11-23 13:08:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:50,220 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 13:08:50,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:08:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 13:08:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:08:50,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:50,221 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:50,222 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:50,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1009720637, now seen corresponding path program 3 times [2018-11-23 13:08:50,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:50,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:50,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:50,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:50,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:50,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {979#true} is VALID [2018-11-23 13:08:50,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {979#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {979#true} is VALID [2018-11-23 13:08:50,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2018-11-23 13:08:50,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #54#return; {979#true} is VALID [2018-11-23 13:08:50,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret5 := main(); {979#true} is VALID [2018-11-23 13:08:50,816 INFO L273 TraceCheckUtils]: 5: Hoare triple {979#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {981#(= main_~index~0 0)} is VALID [2018-11-23 13:08:50,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {981#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {982#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:50,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {982#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {983#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:08:50,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {983#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {984#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 3))} is VALID [2018-11-23 13:08:50,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {984#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 3))} assume !(~index~0 % 4294967296 < 10000); {980#false} is VALID [2018-11-23 13:08:50,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {980#false} ~index~0 := 0; {980#false} is VALID [2018-11-23 13:08:50,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {980#false} is VALID [2018-11-23 13:08:50,828 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {980#false} is VALID [2018-11-23 13:08:50,828 INFO L256 TraceCheckUtils]: 13: Hoare triple {980#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {980#false} is VALID [2018-11-23 13:08:50,829 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#false} ~cond := #in~cond; {980#false} is VALID [2018-11-23 13:08:50,829 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#false} assume 0 == ~cond; {980#false} is VALID [2018-11-23 13:08:50,829 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#false} assume !false; {980#false} is VALID [2018-11-23 13:08:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:50,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:50,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:50,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:08:50,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:08:50,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:50,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:51,257 INFO L256 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {979#true} is VALID [2018-11-23 13:08:51,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {979#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {979#true} is VALID [2018-11-23 13:08:51,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2018-11-23 13:08:51,258 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #54#return; {979#true} is VALID [2018-11-23 13:08:51,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret5 := main(); {979#true} is VALID [2018-11-23 13:08:51,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {979#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {981#(= main_~index~0 0)} is VALID [2018-11-23 13:08:51,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {981#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {982#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:51,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {982#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1009#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:08:51,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {1009#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1013#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:08:51,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {1013#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {980#false} is VALID [2018-11-23 13:08:51,274 INFO L273 TraceCheckUtils]: 10: Hoare triple {980#false} ~index~0 := 0; {980#false} is VALID [2018-11-23 13:08:51,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {980#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {980#false} is VALID [2018-11-23 13:08:51,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {980#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {980#false} is VALID [2018-11-23 13:08:51,275 INFO L256 TraceCheckUtils]: 13: Hoare triple {980#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {980#false} is VALID [2018-11-23 13:08:51,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {980#false} ~cond := #in~cond; {980#false} is VALID [2018-11-23 13:08:51,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {980#false} assume 0 == ~cond; {980#false} is VALID [2018-11-23 13:08:51,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {980#false} assume !false; {980#false} is VALID [2018-11-23 13:08:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:51,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:51,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 13:08:51,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:08:51,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:51,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:08:51,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:51,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:08:51,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:08:51,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:51,340 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 8 states. [2018-11-23 13:08:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:52,249 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 13:08:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:08:52,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 13:08:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 13:08:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:08:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 13:08:52,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-23 13:08:52,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:52,405 INFO L225 Difference]: With dead ends: 69 [2018-11-23 13:08:52,405 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:08:52,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:08:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2018-11-23 13:08:52,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:52,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 28 states. [2018-11-23 13:08:52,519 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 28 states. [2018-11-23 13:08:52,519 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 28 states. [2018-11-23 13:08:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:52,523 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-23 13:08:52,523 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2018-11-23 13:08:52,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:52,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:52,524 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 52 states. [2018-11-23 13:08:52,524 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 52 states. [2018-11-23 13:08:52,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:52,527 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2018-11-23 13:08:52,527 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2018-11-23 13:08:52,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:52,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:52,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:52,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:08:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 13:08:52,530 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 17 [2018-11-23 13:08:52,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:52,530 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 13:08:52,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:08:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 13:08:52,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:08:52,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:52,531 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:52,531 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:52,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:52,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1372891437, now seen corresponding path program 4 times [2018-11-23 13:08:52,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:52,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:52,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:52,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:53,020 INFO L256 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2018-11-23 13:08:53,021 INFO L273 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1283#true} is VALID [2018-11-23 13:08:53,021 INFO L273 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-23 13:08:53,021 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #54#return; {1283#true} is VALID [2018-11-23 13:08:53,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret5 := main(); {1283#true} is VALID [2018-11-23 13:08:53,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1283#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {1285#(= main_~index~0 0)} is VALID [2018-11-23 13:08:53,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {1285#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:53,060 INFO L273 TraceCheckUtils]: 7: Hoare triple {1286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1287#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:08:53,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {1287#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1288#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:08:53,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {1288#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1289#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4))} is VALID [2018-11-23 13:08:53,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {1289#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4))} assume !(~index~0 % 4294967296 < 10000); {1284#false} is VALID [2018-11-23 13:08:53,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {1284#false} ~index~0 := 0; {1284#false} is VALID [2018-11-23 13:08:53,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {1284#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1284#false} is VALID [2018-11-23 13:08:53,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {1284#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1284#false} is VALID [2018-11-23 13:08:53,068 INFO L256 TraceCheckUtils]: 14: Hoare triple {1284#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1284#false} is VALID [2018-11-23 13:08:53,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2018-11-23 13:08:53,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {1284#false} assume 0 == ~cond; {1284#false} is VALID [2018-11-23 13:08:53,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2018-11-23 13:08:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:53,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:53,072 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:53,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:08:53,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:08:53,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:53,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:53,371 INFO L256 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2018-11-23 13:08:53,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1283#true} is VALID [2018-11-23 13:08:53,372 INFO L273 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-23 13:08:53,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #54#return; {1283#true} is VALID [2018-11-23 13:08:53,372 INFO L256 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret5 := main(); {1283#true} is VALID [2018-11-23 13:08:53,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {1283#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {1285#(= main_~index~0 0)} is VALID [2018-11-23 13:08:53,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {1285#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:53,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {1286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1314#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:08:53,383 INFO L273 TraceCheckUtils]: 8: Hoare triple {1314#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1318#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:08:53,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {1318#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1322#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:08:53,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {1322#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {1284#false} is VALID [2018-11-23 13:08:53,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {1284#false} ~index~0 := 0; {1284#false} is VALID [2018-11-23 13:08:53,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {1284#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1284#false} is VALID [2018-11-23 13:08:53,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {1284#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1284#false} is VALID [2018-11-23 13:08:53,389 INFO L256 TraceCheckUtils]: 14: Hoare triple {1284#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1284#false} is VALID [2018-11-23 13:08:53,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2018-11-23 13:08:53,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {1284#false} assume 0 == ~cond; {1284#false} is VALID [2018-11-23 13:08:53,390 INFO L273 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2018-11-23 13:08:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:53,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:53,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-23 13:08:53,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:08:53,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:53,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:08:53,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:53,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:08:53,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:08:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:08:53,486 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2018-11-23 13:08:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:55,837 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2018-11-23 13:08:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:08:55,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-11-23 13:08:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:55,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:08:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 13:08:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:08:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 13:08:55,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-23 13:08:55,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:55,974 INFO L225 Difference]: With dead ends: 76 [2018-11-23 13:08:55,974 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:08:55,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:08:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:08:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 29. [2018-11-23 13:08:56,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:56,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 29 states. [2018-11-23 13:08:56,011 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 29 states. [2018-11-23 13:08:56,012 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 29 states. [2018-11-23 13:08:56,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,015 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 13:08:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2018-11-23 13:08:56,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:56,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:56,016 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 59 states. [2018-11-23 13:08:56,016 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 59 states. [2018-11-23 13:08:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:56,019 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 13:08:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2018-11-23 13:08:56,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:56,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:56,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:56,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:08:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-23 13:08:56,022 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2018-11-23 13:08:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:56,022 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-23 13:08:56,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:08:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 13:08:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:08:56,023 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:56,023 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:56,023 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:56,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:56,023 INFO L82 PathProgramCache]: Analyzing trace with hash -253715651, now seen corresponding path program 5 times [2018-11-23 13:08:56,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:56,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:56,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:56,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:56,701 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2018-11-23 13:08:56,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {1619#true} call ULTIMATE.init(); {1619#true} is VALID [2018-11-23 13:08:56,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {1619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1619#true} is VALID [2018-11-23 13:08:56,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {1619#true} assume true; {1619#true} is VALID [2018-11-23 13:08:56,864 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1619#true} {1619#true} #54#return; {1619#true} is VALID [2018-11-23 13:08:56,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {1619#true} call #t~ret5 := main(); {1619#true} is VALID [2018-11-23 13:08:56,866 INFO L273 TraceCheckUtils]: 5: Hoare triple {1619#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {1621#(= main_~index~0 0)} is VALID [2018-11-23 13:08:56,867 INFO L273 TraceCheckUtils]: 6: Hoare triple {1621#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1622#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:56,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {1622#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1623#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:08:56,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {1623#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1624#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:08:56,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {1624#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1625#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:08:56,883 INFO L273 TraceCheckUtils]: 10: Hoare triple {1625#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1626#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 5))} is VALID [2018-11-23 13:08:56,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {1626#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 5))} assume !(~index~0 % 4294967296 < 10000); {1620#false} is VALID [2018-11-23 13:08:56,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {1620#false} ~index~0 := 0; {1620#false} is VALID [2018-11-23 13:08:56,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {1620#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1620#false} is VALID [2018-11-23 13:08:56,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {1620#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1620#false} is VALID [2018-11-23 13:08:56,885 INFO L256 TraceCheckUtils]: 15: Hoare triple {1620#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1620#false} is VALID [2018-11-23 13:08:56,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {1620#false} ~cond := #in~cond; {1620#false} is VALID [2018-11-23 13:08:56,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {1620#false} assume 0 == ~cond; {1620#false} is VALID [2018-11-23 13:08:56,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {1620#false} assume !false; {1620#false} is VALID [2018-11-23 13:08:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:56,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:08:56,886 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:08:56,899 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:08:56,993 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 13:08:56,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:08:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:57,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:57,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {1619#true} call ULTIMATE.init(); {1619#true} is VALID [2018-11-23 13:08:57,282 INFO L273 TraceCheckUtils]: 1: Hoare triple {1619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1619#true} is VALID [2018-11-23 13:08:57,282 INFO L273 TraceCheckUtils]: 2: Hoare triple {1619#true} assume true; {1619#true} is VALID [2018-11-23 13:08:57,282 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1619#true} {1619#true} #54#return; {1619#true} is VALID [2018-11-23 13:08:57,282 INFO L256 TraceCheckUtils]: 4: Hoare triple {1619#true} call #t~ret5 := main(); {1619#true} is VALID [2018-11-23 13:08:57,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {1619#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {1621#(= main_~index~0 0)} is VALID [2018-11-23 13:08:57,284 INFO L273 TraceCheckUtils]: 6: Hoare triple {1621#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1622#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:08:57,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {1622#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1651#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:08:57,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {1651#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1655#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:08:57,294 INFO L273 TraceCheckUtils]: 9: Hoare triple {1655#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1659#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:08:57,302 INFO L273 TraceCheckUtils]: 10: Hoare triple {1659#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1663#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:08:57,304 INFO L273 TraceCheckUtils]: 11: Hoare triple {1663#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {1620#false} is VALID [2018-11-23 13:08:57,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {1620#false} ~index~0 := 0; {1620#false} is VALID [2018-11-23 13:08:57,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {1620#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1620#false} is VALID [2018-11-23 13:08:57,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {1620#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1620#false} is VALID [2018-11-23 13:08:57,305 INFO L256 TraceCheckUtils]: 15: Hoare triple {1620#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1620#false} is VALID [2018-11-23 13:08:57,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {1620#false} ~cond := #in~cond; {1620#false} is VALID [2018-11-23 13:08:57,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {1620#false} assume 0 == ~cond; {1620#false} is VALID [2018-11-23 13:08:57,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {1620#false} assume !false; {1620#false} is VALID [2018-11-23 13:08:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:57,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:08:57,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 13:08:57,328 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-23 13:08:57,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:57,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:08:57,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:57,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:08:57,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:08:57,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:08:57,391 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 12 states. [2018-11-23 13:08:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:59,257 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2018-11-23 13:08:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:08:59,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-11-23 13:08:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-23 13:08:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:08:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-23 13:08:59,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2018-11-23 13:08:59,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:59,461 INFO L225 Difference]: With dead ends: 83 [2018-11-23 13:08:59,461 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:08:59,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:08:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:08:59,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 30. [2018-11-23 13:08:59,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:59,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 30 states. [2018-11-23 13:08:59,490 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 30 states. [2018-11-23 13:08:59,490 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 30 states. [2018-11-23 13:08:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:59,497 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2018-11-23 13:08:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2018-11-23 13:08:59,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:59,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:59,498 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 66 states. [2018-11-23 13:08:59,498 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 66 states. [2018-11-23 13:08:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:59,502 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2018-11-23 13:08:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2018-11-23 13:08:59,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:59,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:59,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:59,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:08:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 13:08:59,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2018-11-23 13:08:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:59,505 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 13:08:59,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:08:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 13:08:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:08:59,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:59,506 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:59,506 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:59,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash 861072173, now seen corresponding path program 6 times [2018-11-23 13:08:59,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:59,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:59,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:59,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:08:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:00,102 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2018-11-23 13:09:00,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {1987#true} call ULTIMATE.init(); {1987#true} is VALID [2018-11-23 13:09:00,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {1987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1987#true} is VALID [2018-11-23 13:09:00,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {1987#true} assume true; {1987#true} is VALID [2018-11-23 13:09:00,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1987#true} {1987#true} #54#return; {1987#true} is VALID [2018-11-23 13:09:00,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {1987#true} call #t~ret5 := main(); {1987#true} is VALID [2018-11-23 13:09:00,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {1987#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {1989#(= main_~index~0 0)} is VALID [2018-11-23 13:09:00,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {1989#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1990#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:00,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {1990#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1991#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:00,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {1991#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1992#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:00,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {1992#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1993#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:00,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {1993#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1994#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:00,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {1994#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1995#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 6))} is VALID [2018-11-23 13:09:00,329 INFO L273 TraceCheckUtils]: 12: Hoare triple {1995#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 6))} assume !(~index~0 % 4294967296 < 10000); {1988#false} is VALID [2018-11-23 13:09:00,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {1988#false} ~index~0 := 0; {1988#false} is VALID [2018-11-23 13:09:00,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {1988#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1988#false} is VALID [2018-11-23 13:09:00,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {1988#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1988#false} is VALID [2018-11-23 13:09:00,330 INFO L256 TraceCheckUtils]: 16: Hoare triple {1988#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1988#false} is VALID [2018-11-23 13:09:00,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {1988#false} ~cond := #in~cond; {1988#false} is VALID [2018-11-23 13:09:00,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {1988#false} assume 0 == ~cond; {1988#false} is VALID [2018-11-23 13:09:00,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2018-11-23 13:09:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:00,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:00,332 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 [2018-11-23 13:09:00,341 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:09:00,465 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 13:09:00,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:00,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:00,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {1987#true} call ULTIMATE.init(); {1987#true} is VALID [2018-11-23 13:09:00,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {1987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1987#true} is VALID [2018-11-23 13:09:00,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {1987#true} assume true; {1987#true} is VALID [2018-11-23 13:09:00,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1987#true} {1987#true} #54#return; {1987#true} is VALID [2018-11-23 13:09:00,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {1987#true} call #t~ret5 := main(); {1987#true} is VALID [2018-11-23 13:09:00,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {1987#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {1989#(= main_~index~0 0)} is VALID [2018-11-23 13:09:00,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {1989#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {1990#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:00,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {1990#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2020#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:09:00,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {2020#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2024#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:09:00,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {2024#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2028#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:09:00,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {2028#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2032#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:09:00,849 INFO L273 TraceCheckUtils]: 11: Hoare triple {2032#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2036#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:09:00,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {2036#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {1988#false} is VALID [2018-11-23 13:09:00,850 INFO L273 TraceCheckUtils]: 13: Hoare triple {1988#false} ~index~0 := 0; {1988#false} is VALID [2018-11-23 13:09:00,851 INFO L273 TraceCheckUtils]: 14: Hoare triple {1988#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {1988#false} is VALID [2018-11-23 13:09:00,851 INFO L273 TraceCheckUtils]: 15: Hoare triple {1988#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {1988#false} is VALID [2018-11-23 13:09:00,851 INFO L256 TraceCheckUtils]: 16: Hoare triple {1988#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {1988#false} is VALID [2018-11-23 13:09:00,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {1988#false} ~cond := #in~cond; {1988#false} is VALID [2018-11-23 13:09:00,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {1988#false} assume 0 == ~cond; {1988#false} is VALID [2018-11-23 13:09:00,852 INFO L273 TraceCheckUtils]: 19: Hoare triple {1988#false} assume !false; {1988#false} is VALID [2018-11-23 13:09:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:00,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:00,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 13:09:00,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:09:00,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:00,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:09:00,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:00,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:09:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:09:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:09:00,912 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 14 states. [2018-11-23 13:09:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:03,936 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2018-11-23 13:09:03,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:09:03,937 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 13:09:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:09:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-11-23 13:09:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:09:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 91 transitions. [2018-11-23 13:09:03,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 91 transitions. [2018-11-23 13:09:04,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:04,104 INFO L225 Difference]: With dead ends: 90 [2018-11-23 13:09:04,104 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 13:09:04,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:09:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 13:09:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 31. [2018-11-23 13:09:04,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:04,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 31 states. [2018-11-23 13:09:04,152 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 31 states. [2018-11-23 13:09:04,152 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 31 states. [2018-11-23 13:09:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:04,158 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2018-11-23 13:09:04,158 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2018-11-23 13:09:04,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:04,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:04,159 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 73 states. [2018-11-23 13:09:04,159 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 73 states. [2018-11-23 13:09:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:04,163 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2018-11-23 13:09:04,163 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2018-11-23 13:09:04,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:04,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:04,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:04,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:09:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 13:09:04,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-11-23 13:09:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:04,166 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 13:09:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:09:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 13:09:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:09:04,167 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:04,167 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:04,167 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:04,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:04,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1059756349, now seen corresponding path program 7 times [2018-11-23 13:09:04,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:04,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:04,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:04,649 INFO L256 TraceCheckUtils]: 0: Hoare triple {2387#true} call ULTIMATE.init(); {2387#true} is VALID [2018-11-23 13:09:04,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2387#true} is VALID [2018-11-23 13:09:04,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {2387#true} assume true; {2387#true} is VALID [2018-11-23 13:09:04,650 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} #54#return; {2387#true} is VALID [2018-11-23 13:09:04,650 INFO L256 TraceCheckUtils]: 4: Hoare triple {2387#true} call #t~ret5 := main(); {2387#true} is VALID [2018-11-23 13:09:04,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {2387#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {2389#(= main_~index~0 0)} is VALID [2018-11-23 13:09:04,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {2389#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2390#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:04,656 INFO L273 TraceCheckUtils]: 7: Hoare triple {2390#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2391#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:04,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {2391#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2392#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:04,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {2392#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2393#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:04,660 INFO L273 TraceCheckUtils]: 10: Hoare triple {2393#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2394#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:04,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {2394#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2395#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:09:04,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {2395#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2396#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 7))} is VALID [2018-11-23 13:09:04,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {2396#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 7))} assume !(~index~0 % 4294967296 < 10000); {2388#false} is VALID [2018-11-23 13:09:04,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {2388#false} ~index~0 := 0; {2388#false} is VALID [2018-11-23 13:09:04,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {2388#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2388#false} is VALID [2018-11-23 13:09:04,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {2388#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2388#false} is VALID [2018-11-23 13:09:04,672 INFO L256 TraceCheckUtils]: 17: Hoare triple {2388#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2388#false} is VALID [2018-11-23 13:09:04,672 INFO L273 TraceCheckUtils]: 18: Hoare triple {2388#false} ~cond := #in~cond; {2388#false} is VALID [2018-11-23 13:09:04,673 INFO L273 TraceCheckUtils]: 19: Hoare triple {2388#false} assume 0 == ~cond; {2388#false} is VALID [2018-11-23 13:09:04,673 INFO L273 TraceCheckUtils]: 20: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2018-11-23 13:09:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:04,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:04,675 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 [2018-11-23 13:09:04,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:04,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:06,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {2387#true} call ULTIMATE.init(); {2387#true} is VALID [2018-11-23 13:09:06,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2387#true} is VALID [2018-11-23 13:09:06,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {2387#true} assume true; {2387#true} is VALID [2018-11-23 13:09:06,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} #54#return; {2387#true} is VALID [2018-11-23 13:09:06,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {2387#true} call #t~ret5 := main(); {2387#true} is VALID [2018-11-23 13:09:06,145 INFO L273 TraceCheckUtils]: 5: Hoare triple {2387#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {2389#(= main_~index~0 0)} is VALID [2018-11-23 13:09:06,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {2389#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2390#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:06,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {2390#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2421#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:09:06,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {2421#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2425#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:09:06,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {2425#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2429#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:09:06,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {2429#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2433#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:09:06,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {2433#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2437#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:09:06,173 INFO L273 TraceCheckUtils]: 12: Hoare triple {2437#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2441#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:09:06,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {2441#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {2388#false} is VALID [2018-11-23 13:09:06,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {2388#false} ~index~0 := 0; {2388#false} is VALID [2018-11-23 13:09:06,174 INFO L273 TraceCheckUtils]: 15: Hoare triple {2388#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2388#false} is VALID [2018-11-23 13:09:06,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {2388#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2388#false} is VALID [2018-11-23 13:09:06,175 INFO L256 TraceCheckUtils]: 17: Hoare triple {2388#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2388#false} is VALID [2018-11-23 13:09:06,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {2388#false} ~cond := #in~cond; {2388#false} is VALID [2018-11-23 13:09:06,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {2388#false} assume 0 == ~cond; {2388#false} is VALID [2018-11-23 13:09:06,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2018-11-23 13:09:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:06,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:06,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-23 13:09:06,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-23 13:09:06,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:06,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:09:06,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:06,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:09:06,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:09:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:06,329 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-11-23 13:09:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,136 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2018-11-23 13:09:10,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:09:10,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-23 13:09:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:09:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 13:09:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:09:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 99 transitions. [2018-11-23 13:09:10,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 99 transitions. [2018-11-23 13:09:10,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:10,336 INFO L225 Difference]: With dead ends: 97 [2018-11-23 13:09:10,336 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 13:09:10,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:09:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 13:09:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 32. [2018-11-23 13:09:10,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:10,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 32 states. [2018-11-23 13:09:10,377 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 32 states. [2018-11-23 13:09:10,377 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 32 states. [2018-11-23 13:09:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,381 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 13:09:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 13:09:10,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:10,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:10,382 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 80 states. [2018-11-23 13:09:10,382 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 80 states. [2018-11-23 13:09:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:10,385 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2018-11-23 13:09:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 106 transitions. [2018-11-23 13:09:10,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:10,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:10,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:10,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:09:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 13:09:10,387 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-11-23 13:09:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:10,388 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 13:09:10,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:09:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 13:09:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:09:10,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:10,388 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:10,389 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:10,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1370968787, now seen corresponding path program 8 times [2018-11-23 13:09:10,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:10,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:10,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:10,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:09:10,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:10,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2018-11-23 13:09:10,705 INFO L273 TraceCheckUtils]: 1: Hoare triple {2819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2819#true} is VALID [2018-11-23 13:09:10,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2018-11-23 13:09:10,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #54#return; {2819#true} is VALID [2018-11-23 13:09:10,706 INFO L256 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret5 := main(); {2819#true} is VALID [2018-11-23 13:09:10,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {2819#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {2821#(= main_~index~0 0)} is VALID [2018-11-23 13:09:10,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {2821#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2822#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:10,710 INFO L273 TraceCheckUtils]: 7: Hoare triple {2822#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2823#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:10,711 INFO L273 TraceCheckUtils]: 8: Hoare triple {2823#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2824#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:10,712 INFO L273 TraceCheckUtils]: 9: Hoare triple {2824#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2825#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:10,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {2825#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2826#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:10,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {2826#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2827#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:09:10,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {2827#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2828#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:09:10,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {2828#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2829#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 8))} is VALID [2018-11-23 13:09:10,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {2829#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 8))} assume !(~index~0 % 4294967296 < 10000); {2820#false} is VALID [2018-11-23 13:09:10,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {2820#false} ~index~0 := 0; {2820#false} is VALID [2018-11-23 13:09:10,721 INFO L273 TraceCheckUtils]: 16: Hoare triple {2820#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2820#false} is VALID [2018-11-23 13:09:10,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {2820#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2820#false} is VALID [2018-11-23 13:09:10,722 INFO L256 TraceCheckUtils]: 18: Hoare triple {2820#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2820#false} is VALID [2018-11-23 13:09:10,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {2820#false} ~cond := #in~cond; {2820#false} is VALID [2018-11-23 13:09:10,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {2820#false} assume 0 == ~cond; {2820#false} is VALID [2018-11-23 13:09:10,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2018-11-23 13:09:10,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:10,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:10,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:10,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:09:10,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:09:10,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:10,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:11,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2018-11-23 13:09:11,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {2819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2819#true} is VALID [2018-11-23 13:09:11,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2018-11-23 13:09:11,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #54#return; {2819#true} is VALID [2018-11-23 13:09:11,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret5 := main(); {2819#true} is VALID [2018-11-23 13:09:11,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {2819#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {2821#(= main_~index~0 0)} is VALID [2018-11-23 13:09:11,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {2821#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2822#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:11,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {2822#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2854#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:09:11,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {2854#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2858#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:09:11,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {2858#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2862#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:09:11,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {2862#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2866#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:09:11,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {2866#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2870#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:09:11,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {2870#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2874#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:09:11,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {2874#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {2878#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:09:11,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {2878#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {2820#false} is VALID [2018-11-23 13:09:11,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {2820#false} ~index~0 := 0; {2820#false} is VALID [2018-11-23 13:09:11,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {2820#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {2820#false} is VALID [2018-11-23 13:09:11,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {2820#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {2820#false} is VALID [2018-11-23 13:09:11,348 INFO L256 TraceCheckUtils]: 18: Hoare triple {2820#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {2820#false} is VALID [2018-11-23 13:09:11,348 INFO L273 TraceCheckUtils]: 19: Hoare triple {2820#false} ~cond := #in~cond; {2820#false} is VALID [2018-11-23 13:09:11,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {2820#false} assume 0 == ~cond; {2820#false} is VALID [2018-11-23 13:09:11,349 INFO L273 TraceCheckUtils]: 21: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2018-11-23 13:09:11,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:11,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-11-23 13:09:11,370 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 13:09:11,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:11,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:09:11,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:11,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:09:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:09:11,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:09:11,452 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 18 states. [2018-11-23 13:09:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:14,802 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2018-11-23 13:09:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:09:14,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2018-11-23 13:09:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:09:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2018-11-23 13:09:14,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:09:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 107 transitions. [2018-11-23 13:09:14,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 107 transitions. [2018-11-23 13:09:15,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:15,026 INFO L225 Difference]: With dead ends: 104 [2018-11-23 13:09:15,027 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 13:09:15,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:09:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 13:09:15,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 33. [2018-11-23 13:09:15,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:15,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 33 states. [2018-11-23 13:09:15,111 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 33 states. [2018-11-23 13:09:15,112 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 33 states. [2018-11-23 13:09:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,116 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2018-11-23 13:09:15,116 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2018-11-23 13:09:15,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:15,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:15,117 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 87 states. [2018-11-23 13:09:15,117 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 87 states. [2018-11-23 13:09:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:15,120 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2018-11-23 13:09:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2018-11-23 13:09:15,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:15,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:15,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:15,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:09:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 13:09:15,123 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-11-23 13:09:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:15,123 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 13:09:15,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:09:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 13:09:15,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:09:15,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:15,124 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:15,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:15,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:15,125 INFO L82 PathProgramCache]: Analyzing trace with hash 585963325, now seen corresponding path program 9 times [2018-11-23 13:09:15,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:15,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:15,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:15,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:15,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {3283#true} call ULTIMATE.init(); {3283#true} is VALID [2018-11-23 13:09:15,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {3283#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3283#true} is VALID [2018-11-23 13:09:15,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {3283#true} assume true; {3283#true} is VALID [2018-11-23 13:09:15,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3283#true} {3283#true} #54#return; {3283#true} is VALID [2018-11-23 13:09:15,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {3283#true} call #t~ret5 := main(); {3283#true} is VALID [2018-11-23 13:09:15,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {3283#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {3285#(= main_~index~0 0)} is VALID [2018-11-23 13:09:15,496 INFO L273 TraceCheckUtils]: 6: Hoare triple {3285#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:15,499 INFO L273 TraceCheckUtils]: 7: Hoare triple {3286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3287#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:15,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {3287#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3288#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:15,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {3288#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3289#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:15,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {3289#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3290#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:15,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {3290#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3291#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:09:15,506 INFO L273 TraceCheckUtils]: 12: Hoare triple {3291#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3292#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:09:15,507 INFO L273 TraceCheckUtils]: 13: Hoare triple {3292#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3293#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:09:15,515 INFO L273 TraceCheckUtils]: 14: Hoare triple {3293#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3294#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 9))} is VALID [2018-11-23 13:09:15,516 INFO L273 TraceCheckUtils]: 15: Hoare triple {3294#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 9))} assume !(~index~0 % 4294967296 < 10000); {3284#false} is VALID [2018-11-23 13:09:15,516 INFO L273 TraceCheckUtils]: 16: Hoare triple {3284#false} ~index~0 := 0; {3284#false} is VALID [2018-11-23 13:09:15,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {3284#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3284#false} is VALID [2018-11-23 13:09:15,517 INFO L273 TraceCheckUtils]: 18: Hoare triple {3284#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {3284#false} is VALID [2018-11-23 13:09:15,517 INFO L256 TraceCheckUtils]: 19: Hoare triple {3284#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3284#false} is VALID [2018-11-23 13:09:15,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#false} ~cond := #in~cond; {3284#false} is VALID [2018-11-23 13:09:15,517 INFO L273 TraceCheckUtils]: 21: Hoare triple {3284#false} assume 0 == ~cond; {3284#false} is VALID [2018-11-23 13:09:15,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {3284#false} assume !false; {3284#false} is VALID [2018-11-23 13:09:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:15,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:15,519 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:09:18,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:09:18,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:18,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:20,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {3283#true} call ULTIMATE.init(); {3283#true} is VALID [2018-11-23 13:09:20,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {3283#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3283#true} is VALID [2018-11-23 13:09:20,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {3283#true} assume true; {3283#true} is VALID [2018-11-23 13:09:20,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3283#true} {3283#true} #54#return; {3283#true} is VALID [2018-11-23 13:09:20,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {3283#true} call #t~ret5 := main(); {3283#true} is VALID [2018-11-23 13:09:20,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {3283#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {3285#(= main_~index~0 0)} is VALID [2018-11-23 13:09:20,896 INFO L273 TraceCheckUtils]: 6: Hoare triple {3285#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:20,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {3286#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3319#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:09:20,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {3319#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3323#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:09:20,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {3323#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3327#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:09:20,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {3327#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3331#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:09:20,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {3331#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3335#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:09:20,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {3335#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3339#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:09:20,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {3339#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3343#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:09:20,930 INFO L273 TraceCheckUtils]: 14: Hoare triple {3343#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3347#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} is VALID [2018-11-23 13:09:20,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {3347#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {3284#false} is VALID [2018-11-23 13:09:20,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {3284#false} ~index~0 := 0; {3284#false} is VALID [2018-11-23 13:09:20,932 INFO L273 TraceCheckUtils]: 17: Hoare triple {3284#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3284#false} is VALID [2018-11-23 13:09:20,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {3284#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {3284#false} is VALID [2018-11-23 13:09:20,932 INFO L256 TraceCheckUtils]: 19: Hoare triple {3284#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3284#false} is VALID [2018-11-23 13:09:20,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#false} ~cond := #in~cond; {3284#false} is VALID [2018-11-23 13:09:20,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {3284#false} assume 0 == ~cond; {3284#false} is VALID [2018-11-23 13:09:20,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {3284#false} assume !false; {3284#false} is VALID [2018-11-23 13:09:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:20,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:20,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-11-23 13:09:20,955 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-11-23 13:09:20,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:20,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:09:21,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:21,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:09:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:09:21,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:09:21,031 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 20 states. [2018-11-23 13:09:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:31,618 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2018-11-23 13:09:31,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:09:31,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-11-23 13:09:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:09:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2018-11-23 13:09:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:09:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2018-11-23 13:09:31,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 115 transitions. [2018-11-23 13:09:31,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:31,828 INFO L225 Difference]: With dead ends: 111 [2018-11-23 13:09:31,829 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 13:09:31,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:09:31,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 13:09:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 34. [2018-11-23 13:09:31,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:31,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 34 states. [2018-11-23 13:09:31,879 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 34 states. [2018-11-23 13:09:31,879 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 34 states. [2018-11-23 13:09:31,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:31,883 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2018-11-23 13:09:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2018-11-23 13:09:31,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:31,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:31,884 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 94 states. [2018-11-23 13:09:31,884 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 94 states. [2018-11-23 13:09:31,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:31,888 INFO L93 Difference]: Finished difference Result 94 states and 126 transitions. [2018-11-23 13:09:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2018-11-23 13:09:31,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:31,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:31,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:31,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:09:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 13:09:31,890 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2018-11-23 13:09:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:31,890 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 13:09:31,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:09:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 13:09:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:09:31,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:31,891 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:31,892 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:31,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1121316653, now seen corresponding path program 10 times [2018-11-23 13:09:31,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:31,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:31,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:31,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:32,676 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-11-23 13:09:32,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3779#true} is VALID [2018-11-23 13:09:32,879 INFO L273 TraceCheckUtils]: 1: Hoare triple {3779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3779#true} is VALID [2018-11-23 13:09:32,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2018-11-23 13:09:32,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #54#return; {3779#true} is VALID [2018-11-23 13:09:32,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret5 := main(); {3779#true} is VALID [2018-11-23 13:09:32,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {3779#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {3781#(= main_~index~0 0)} is VALID [2018-11-23 13:09:32,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {3781#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3782#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:32,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {3782#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3783#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:32,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {3783#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3784#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:32,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {3784#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3785#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:32,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {3785#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3786#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:32,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {3786#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3787#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:09:32,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {3787#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3788#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:09:32,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {3788#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3789#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:09:32,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {3789#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3790#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} is VALID [2018-11-23 13:09:32,907 INFO L273 TraceCheckUtils]: 15: Hoare triple {3790#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3791#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 10))} is VALID [2018-11-23 13:09:32,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {3791#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 10))} assume !(~index~0 % 4294967296 < 10000); {3780#false} is VALID [2018-11-23 13:09:32,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {3780#false} ~index~0 := 0; {3780#false} is VALID [2018-11-23 13:09:32,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {3780#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3780#false} is VALID [2018-11-23 13:09:32,908 INFO L273 TraceCheckUtils]: 19: Hoare triple {3780#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {3780#false} is VALID [2018-11-23 13:09:32,909 INFO L256 TraceCheckUtils]: 20: Hoare triple {3780#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3780#false} is VALID [2018-11-23 13:09:32,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {3780#false} ~cond := #in~cond; {3780#false} is VALID [2018-11-23 13:09:32,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {3780#false} assume 0 == ~cond; {3780#false} is VALID [2018-11-23 13:09:32,909 INFO L273 TraceCheckUtils]: 23: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2018-11-23 13:09:32,910 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:32,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:32,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:32,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:09:32,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:09:32,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:32,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:33,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {3779#true} call ULTIMATE.init(); {3779#true} is VALID [2018-11-23 13:09:33,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {3779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3779#true} is VALID [2018-11-23 13:09:33,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {3779#true} assume true; {3779#true} is VALID [2018-11-23 13:09:33,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3779#true} {3779#true} #54#return; {3779#true} is VALID [2018-11-23 13:09:33,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {3779#true} call #t~ret5 := main(); {3779#true} is VALID [2018-11-23 13:09:33,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {3779#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {3781#(= main_~index~0 0)} is VALID [2018-11-23 13:09:33,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {3781#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3782#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:33,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {3782#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3816#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:09:33,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {3816#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3820#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:09:33,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {3820#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3824#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:09:33,763 INFO L273 TraceCheckUtils]: 10: Hoare triple {3824#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3828#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:09:33,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {3828#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3832#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:09:33,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {3832#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3836#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:09:33,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {3836#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3840#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:09:33,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {3840#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3844#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} is VALID [2018-11-23 13:09:33,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {3844#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {3848#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} is VALID [2018-11-23 13:09:33,798 INFO L273 TraceCheckUtils]: 16: Hoare triple {3848#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {3780#false} is VALID [2018-11-23 13:09:33,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {3780#false} ~index~0 := 0; {3780#false} is VALID [2018-11-23 13:09:33,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {3780#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {3780#false} is VALID [2018-11-23 13:09:33,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {3780#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {3780#false} is VALID [2018-11-23 13:09:33,798 INFO L256 TraceCheckUtils]: 20: Hoare triple {3780#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {3780#false} is VALID [2018-11-23 13:09:33,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {3780#false} ~cond := #in~cond; {3780#false} is VALID [2018-11-23 13:09:33,798 INFO L273 TraceCheckUtils]: 22: Hoare triple {3780#false} assume 0 == ~cond; {3780#false} is VALID [2018-11-23 13:09:33,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {3780#false} assume !false; {3780#false} is VALID [2018-11-23 13:09:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:33,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:33,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2018-11-23 13:09:33,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 13:09:33,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:33,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:09:33,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:33,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:09:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:09:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:33,897 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 22 states. [2018-11-23 13:09:40,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:40,293 INFO L93 Difference]: Finished difference Result 118 states and 155 transitions. [2018-11-23 13:09:40,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:09:40,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 13:09:40,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:09:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2018-11-23 13:09:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:09:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2018-11-23 13:09:40,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 123 transitions. [2018-11-23 13:09:40,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:40,923 INFO L225 Difference]: With dead ends: 118 [2018-11-23 13:09:40,924 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 13:09:40,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:09:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 13:09:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 35. [2018-11-23 13:09:40,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:09:40,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 35 states. [2018-11-23 13:09:40,997 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 35 states. [2018-11-23 13:09:40,998 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 35 states. [2018-11-23 13:09:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:41,002 INFO L93 Difference]: Finished difference Result 101 states and 136 transitions. [2018-11-23 13:09:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2018-11-23 13:09:41,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:41,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:41,003 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 101 states. [2018-11-23 13:09:41,003 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 101 states. [2018-11-23 13:09:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:09:41,007 INFO L93 Difference]: Finished difference Result 101 states and 136 transitions. [2018-11-23 13:09:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 136 transitions. [2018-11-23 13:09:41,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:09:41,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:09:41,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:09:41,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:09:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:09:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-23 13:09:41,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 24 [2018-11-23 13:09:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:09:41,009 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-23 13:09:41,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:09:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 13:09:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:09:41,010 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:09:41,010 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:09:41,011 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:09:41,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:09:41,011 INFO L82 PathProgramCache]: Analyzing trace with hash 537400637, now seen corresponding path program 11 times [2018-11-23 13:09:41,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:09:41,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:09:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:41,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:09:41,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:09:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:41,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2018-11-23 13:09:41,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {4307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4307#true} is VALID [2018-11-23 13:09:41,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2018-11-23 13:09:41,502 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #54#return; {4307#true} is VALID [2018-11-23 13:09:41,502 INFO L256 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret5 := main(); {4307#true} is VALID [2018-11-23 13:09:41,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {4307#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {4309#(= main_~index~0 0)} is VALID [2018-11-23 13:09:41,504 INFO L273 TraceCheckUtils]: 6: Hoare triple {4309#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4310#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:41,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {4310#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4311#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:09:41,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {4311#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4312#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:09:41,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {4312#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4313#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:09:41,511 INFO L273 TraceCheckUtils]: 10: Hoare triple {4313#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4314#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:09:41,512 INFO L273 TraceCheckUtils]: 11: Hoare triple {4314#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4315#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:09:41,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {4315#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4316#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:09:41,515 INFO L273 TraceCheckUtils]: 13: Hoare triple {4316#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4317#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:09:41,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {4317#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4318#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} is VALID [2018-11-23 13:09:41,519 INFO L273 TraceCheckUtils]: 15: Hoare triple {4318#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4319#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} is VALID [2018-11-23 13:09:41,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {4319#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4320#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 11))} is VALID [2018-11-23 13:09:41,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {4320#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 11))} assume !(~index~0 % 4294967296 < 10000); {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {4308#false} ~index~0 := 0; {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {4308#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L273 TraceCheckUtils]: 20: Hoare triple {4308#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L256 TraceCheckUtils]: 21: Hoare triple {4308#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L273 TraceCheckUtils]: 22: Hoare triple {4308#false} ~cond := #in~cond; {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {4308#false} assume 0 == ~cond; {4308#false} is VALID [2018-11-23 13:09:41,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2018-11-23 13:09:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:41,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:09:41,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:09:41,538 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:09:58,111 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 13:09:58,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:09:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:09:58,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:09:59,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {4307#true} call ULTIMATE.init(); {4307#true} is VALID [2018-11-23 13:09:59,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {4307#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4307#true} is VALID [2018-11-23 13:09:59,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {4307#true} assume true; {4307#true} is VALID [2018-11-23 13:09:59,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4307#true} {4307#true} #54#return; {4307#true} is VALID [2018-11-23 13:09:59,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {4307#true} call #t~ret5 := main(); {4307#true} is VALID [2018-11-23 13:09:59,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {4307#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {4309#(= main_~index~0 0)} is VALID [2018-11-23 13:09:59,553 INFO L273 TraceCheckUtils]: 6: Hoare triple {4309#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4310#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:09:59,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {4310#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4345#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:09:59,558 INFO L273 TraceCheckUtils]: 8: Hoare triple {4345#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4349#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:09:59,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {4349#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4353#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:09:59,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {4353#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4357#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:09:59,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {4357#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4361#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:09:59,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {4361#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4365#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:09:59,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {4365#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4369#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:09:59,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {4369#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4373#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} is VALID [2018-11-23 13:09:59,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {4373#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4377#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} is VALID [2018-11-23 13:09:59,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {4377#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4381#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} is VALID [2018-11-23 13:09:59,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {4381#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {4308#false} is VALID [2018-11-23 13:09:59,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {4308#false} ~index~0 := 0; {4308#false} is VALID [2018-11-23 13:09:59,591 INFO L273 TraceCheckUtils]: 19: Hoare triple {4308#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {4308#false} is VALID [2018-11-23 13:09:59,591 INFO L273 TraceCheckUtils]: 20: Hoare triple {4308#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {4308#false} is VALID [2018-11-23 13:09:59,591 INFO L256 TraceCheckUtils]: 21: Hoare triple {4308#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {4308#false} is VALID [2018-11-23 13:09:59,592 INFO L273 TraceCheckUtils]: 22: Hoare triple {4308#false} ~cond := #in~cond; {4308#false} is VALID [2018-11-23 13:09:59,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {4308#false} assume 0 == ~cond; {4308#false} is VALID [2018-11-23 13:09:59,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {4308#false} assume !false; {4308#false} is VALID [2018-11-23 13:09:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:09:59,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:09:59,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-11-23 13:09:59,615 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-11-23 13:09:59,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:09:59,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 13:09:59,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:09:59,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 13:09:59,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 13:09:59,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:09:59,724 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 24 states. [2018-11-23 13:10:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:10,406 INFO L93 Difference]: Finished difference Result 125 states and 165 transitions. [2018-11-23 13:10:10,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:10:10,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2018-11-23 13:10:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:10,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:10:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2018-11-23 13:10:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:10:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2018-11-23 13:10:10,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 131 transitions. [2018-11-23 13:10:11,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:11,004 INFO L225 Difference]: With dead ends: 125 [2018-11-23 13:10:11,004 INFO L226 Difference]: Without dead ends: 108 [2018-11-23 13:10:11,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-11-23 13:10:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-23 13:10:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 36. [2018-11-23 13:10:11,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:11,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 36 states. [2018-11-23 13:10:11,147 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 36 states. [2018-11-23 13:10:11,147 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 36 states. [2018-11-23 13:10:11,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:11,151 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-23 13:10:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2018-11-23 13:10:11,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:11,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:11,153 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 108 states. [2018-11-23 13:10:11,153 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 108 states. [2018-11-23 13:10:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:11,156 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-11-23 13:10:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2018-11-23 13:10:11,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:11,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:11,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:11,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 13:10:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 13:10:11,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2018-11-23 13:10:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:11,159 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 13:10:11,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 13:10:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 13:10:11,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:10:11,160 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:11,160 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:11,160 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:11,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash -384126675, now seen corresponding path program 12 times [2018-11-23 13:10:11,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:11,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:11,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:11,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:11,971 INFO L256 TraceCheckUtils]: 0: Hoare triple {4867#true} call ULTIMATE.init(); {4867#true} is VALID [2018-11-23 13:10:11,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {4867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4867#true} is VALID [2018-11-23 13:10:11,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {4867#true} assume true; {4867#true} is VALID [2018-11-23 13:10:11,972 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4867#true} {4867#true} #54#return; {4867#true} is VALID [2018-11-23 13:10:11,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {4867#true} call #t~ret5 := main(); {4867#true} is VALID [2018-11-23 13:10:11,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {4867#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {4869#(= main_~index~0 0)} is VALID [2018-11-23 13:10:11,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {4869#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4870#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:10:11,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {4870#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4871#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:10:11,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {4871#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4872#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:10:11,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {4872#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4873#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:10:11,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {4873#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4874#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:10:11,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {4874#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4875#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:10:11,985 INFO L273 TraceCheckUtils]: 12: Hoare triple {4875#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4876#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:10:11,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {4876#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4877#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:10:11,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {4877#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4878#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} is VALID [2018-11-23 13:10:11,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {4878#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4879#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} is VALID [2018-11-23 13:10:11,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {4879#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4880#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} is VALID [2018-11-23 13:10:11,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {4880#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4881#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 12))} is VALID [2018-11-23 13:10:11,997 INFO L273 TraceCheckUtils]: 18: Hoare triple {4881#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 12))} assume !(~index~0 % 4294967296 < 10000); {4868#false} is VALID [2018-11-23 13:10:11,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {4868#false} ~index~0 := 0; {4868#false} is VALID [2018-11-23 13:10:11,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {4868#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {4868#false} is VALID [2018-11-23 13:10:11,997 INFO L273 TraceCheckUtils]: 21: Hoare triple {4868#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {4868#false} is VALID [2018-11-23 13:10:11,997 INFO L256 TraceCheckUtils]: 22: Hoare triple {4868#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {4868#false} is VALID [2018-11-23 13:10:11,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {4868#false} ~cond := #in~cond; {4868#false} is VALID [2018-11-23 13:10:11,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {4868#false} assume 0 == ~cond; {4868#false} is VALID [2018-11-23 13:10:11,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {4868#false} assume !false; {4868#false} is VALID [2018-11-23 13:10:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:11,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:11,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:12,010 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:10:23,227 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 13:10:23,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:23,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:25,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {4867#true} call ULTIMATE.init(); {4867#true} is VALID [2018-11-23 13:10:25,875 INFO L273 TraceCheckUtils]: 1: Hoare triple {4867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4867#true} is VALID [2018-11-23 13:10:25,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {4867#true} assume true; {4867#true} is VALID [2018-11-23 13:10:25,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4867#true} {4867#true} #54#return; {4867#true} is VALID [2018-11-23 13:10:25,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {4867#true} call #t~ret5 := main(); {4867#true} is VALID [2018-11-23 13:10:25,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {4867#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {4869#(= main_~index~0 0)} is VALID [2018-11-23 13:10:25,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {4869#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4870#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:10:25,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {4870#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4906#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:10:25,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {4906#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4910#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:10:25,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {4910#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4914#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:10:25,903 INFO L273 TraceCheckUtils]: 10: Hoare triple {4914#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4918#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:10:25,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {4918#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4922#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:10:25,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {4922#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4926#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:10:25,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {4926#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4930#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:10:25,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {4930#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4934#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} is VALID [2018-11-23 13:10:25,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {4934#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4938#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} is VALID [2018-11-23 13:10:25,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {4938#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4942#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} is VALID [2018-11-23 13:10:25,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {4942#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {4946#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 11)) 4294967296)) 4294967283) 4294967296)) 12) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 11)) 4294967296) 1)))} is VALID [2018-11-23 13:10:25,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {4946#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 11)) 4294967296)) 4294967283) 4294967296)) 12) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 11)) 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {4868#false} is VALID [2018-11-23 13:10:25,940 INFO L273 TraceCheckUtils]: 19: Hoare triple {4868#false} ~index~0 := 0; {4868#false} is VALID [2018-11-23 13:10:25,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {4868#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {4868#false} is VALID [2018-11-23 13:10:25,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {4868#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {4868#false} is VALID [2018-11-23 13:10:25,941 INFO L256 TraceCheckUtils]: 22: Hoare triple {4868#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {4868#false} is VALID [2018-11-23 13:10:25,941 INFO L273 TraceCheckUtils]: 23: Hoare triple {4868#false} ~cond := #in~cond; {4868#false} is VALID [2018-11-23 13:10:25,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {4868#false} assume 0 == ~cond; {4868#false} is VALID [2018-11-23 13:10:25,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {4868#false} assume !false; {4868#false} is VALID [2018-11-23 13:10:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2018-11-23 13:10:25,963 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-11-23 13:10:25,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:25,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:10:26,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:26,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:10:26,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:10:26,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:10:26,059 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 26 states. [2018-11-23 13:10:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:34,959 INFO L93 Difference]: Finished difference Result 132 states and 175 transitions. [2018-11-23 13:10:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:10:34,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-11-23 13:10:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:10:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2018-11-23 13:10:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:10:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2018-11-23 13:10:34,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 139 transitions. [2018-11-23 13:10:35,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:35,582 INFO L225 Difference]: With dead ends: 132 [2018-11-23 13:10:35,582 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 13:10:35,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:10:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 13:10:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 37. [2018-11-23 13:10:36,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:36,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 37 states. [2018-11-23 13:10:36,094 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 37 states. [2018-11-23 13:10:36,094 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 37 states. [2018-11-23 13:10:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:36,100 INFO L93 Difference]: Finished difference Result 115 states and 156 transitions. [2018-11-23 13:10:36,100 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 156 transitions. [2018-11-23 13:10:36,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:36,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:36,101 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 115 states. [2018-11-23 13:10:36,101 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 115 states. [2018-11-23 13:10:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:36,106 INFO L93 Difference]: Finished difference Result 115 states and 156 transitions. [2018-11-23 13:10:36,106 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 156 transitions. [2018-11-23 13:10:36,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:36,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:36,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:36,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:10:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-23 13:10:36,108 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2018-11-23 13:10:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:36,109 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-23 13:10:36,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:10:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-11-23 13:10:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:10:36,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:36,109 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:36,111 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:36,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:36,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1113297725, now seen corresponding path program 13 times [2018-11-23 13:10:36,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:36,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:36,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:10:36,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:36,899 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2018-11-23 13:10:37,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {5459#true} call ULTIMATE.init(); {5459#true} is VALID [2018-11-23 13:10:37,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {5459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5459#true} is VALID [2018-11-23 13:10:37,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {5459#true} assume true; {5459#true} is VALID [2018-11-23 13:10:37,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5459#true} {5459#true} #54#return; {5459#true} is VALID [2018-11-23 13:10:37,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {5459#true} call #t~ret5 := main(); {5459#true} is VALID [2018-11-23 13:10:37,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {5459#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {5461#(= main_~index~0 0)} is VALID [2018-11-23 13:10:37,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {5461#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5462#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:10:37,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {5462#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5463#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:10:37,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {5463#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5464#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:10:37,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {5464#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5465#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:10:37,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {5465#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5466#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:10:37,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {5466#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5467#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:10:37,259 INFO L273 TraceCheckUtils]: 12: Hoare triple {5467#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5468#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:10:37,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {5468#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5469#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:10:37,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {5469#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5470#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} is VALID [2018-11-23 13:10:37,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {5470#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5471#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} is VALID [2018-11-23 13:10:37,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {5471#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5472#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} is VALID [2018-11-23 13:10:37,267 INFO L273 TraceCheckUtils]: 17: Hoare triple {5472#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5473#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967283) 4294967296)) 12) main_~index~0)} is VALID [2018-11-23 13:10:37,270 INFO L273 TraceCheckUtils]: 18: Hoare triple {5473#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967283) 4294967296)) 12) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5474#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 13))} is VALID [2018-11-23 13:10:37,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {5474#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 13))} assume !(~index~0 % 4294967296 < 10000); {5460#false} is VALID [2018-11-23 13:10:37,271 INFO L273 TraceCheckUtils]: 20: Hoare triple {5460#false} ~index~0 := 0; {5460#false} is VALID [2018-11-23 13:10:37,271 INFO L273 TraceCheckUtils]: 21: Hoare triple {5460#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {5460#false} is VALID [2018-11-23 13:10:37,271 INFO L273 TraceCheckUtils]: 22: Hoare triple {5460#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {5460#false} is VALID [2018-11-23 13:10:37,271 INFO L256 TraceCheckUtils]: 23: Hoare triple {5460#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {5460#false} is VALID [2018-11-23 13:10:37,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {5460#false} ~cond := #in~cond; {5460#false} is VALID [2018-11-23 13:10:37,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {5460#false} assume 0 == ~cond; {5460#false} is VALID [2018-11-23 13:10:37,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {5460#false} assume !false; {5460#false} is VALID [2018-11-23 13:10:37,273 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:37,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:37,273 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:37,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:37,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:38,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {5459#true} call ULTIMATE.init(); {5459#true} is VALID [2018-11-23 13:10:38,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {5459#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5459#true} is VALID [2018-11-23 13:10:38,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {5459#true} assume true; {5459#true} is VALID [2018-11-23 13:10:38,406 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5459#true} {5459#true} #54#return; {5459#true} is VALID [2018-11-23 13:10:38,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {5459#true} call #t~ret5 := main(); {5459#true} is VALID [2018-11-23 13:10:38,406 INFO L273 TraceCheckUtils]: 5: Hoare triple {5459#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {5461#(= main_~index~0 0)} is VALID [2018-11-23 13:10:38,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {5461#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5462#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:10:38,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {5462#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5499#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:10:38,414 INFO L273 TraceCheckUtils]: 8: Hoare triple {5499#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5503#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:10:38,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {5503#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5507#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:10:38,420 INFO L273 TraceCheckUtils]: 10: Hoare triple {5507#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5511#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:10:38,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {5511#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5515#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:10:38,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {5515#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5519#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:10:38,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {5519#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5523#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:10:38,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {5523#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5527#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} is VALID [2018-11-23 13:10:38,439 INFO L273 TraceCheckUtils]: 15: Hoare triple {5527#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5531#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} is VALID [2018-11-23 13:10:38,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {5531#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5535#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} is VALID [2018-11-23 13:10:38,445 INFO L273 TraceCheckUtils]: 17: Hoare triple {5535#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5539#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 11)) 4294967296)) 4294967283) 4294967296)) 12) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 11)) 4294967296) 1)))} is VALID [2018-11-23 13:10:38,449 INFO L273 TraceCheckUtils]: 18: Hoare triple {5539#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 11)) 4294967296)) 4294967283) 4294967296)) 12) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 11)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {5543#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 12)) 4294967296)) 4294967282) 4294967296)) 13) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 12)) 4294967296) 1)))} is VALID [2018-11-23 13:10:38,450 INFO L273 TraceCheckUtils]: 19: Hoare triple {5543#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 12)) 4294967296)) 4294967282) 4294967296)) 13) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 12)) 4294967296) 1)))} assume !(~index~0 % 4294967296 < 10000); {5460#false} is VALID [2018-11-23 13:10:38,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {5460#false} ~index~0 := 0; {5460#false} is VALID [2018-11-23 13:10:38,451 INFO L273 TraceCheckUtils]: 21: Hoare triple {5460#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {5460#false} is VALID [2018-11-23 13:10:38,451 INFO L273 TraceCheckUtils]: 22: Hoare triple {5460#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {5460#false} is VALID [2018-11-23 13:10:38,451 INFO L256 TraceCheckUtils]: 23: Hoare triple {5460#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {5460#false} is VALID [2018-11-23 13:10:38,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {5460#false} ~cond := #in~cond; {5460#false} is VALID [2018-11-23 13:10:38,452 INFO L273 TraceCheckUtils]: 25: Hoare triple {5460#false} assume 0 == ~cond; {5460#false} is VALID [2018-11-23 13:10:38,452 INFO L273 TraceCheckUtils]: 26: Hoare triple {5460#false} assume !false; {5460#false} is VALID [2018-11-23 13:10:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:38,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:38,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2018-11-23 13:10:38,473 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-11-23 13:10:38,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:38,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 13:10:38,593 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:38,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 13:10:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 13:10:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:10:38,594 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 28 states. [2018-11-23 13:10:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:50,637 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2018-11-23 13:10:50,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:10:50,637 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-11-23 13:10:50,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:10:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2018-11-23 13:10:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:10:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2018-11-23 13:10:50,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 147 transitions. [2018-11-23 13:10:51,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:51,205 INFO L225 Difference]: With dead ends: 139 [2018-11-23 13:10:51,205 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 13:10:51,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:10:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 13:10:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 38. [2018-11-23 13:10:51,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:10:51,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 38 states. [2018-11-23 13:10:51,260 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 38 states. [2018-11-23 13:10:51,260 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 38 states. [2018-11-23 13:10:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,265 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2018-11-23 13:10:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2018-11-23 13:10:51,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,266 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 122 states. [2018-11-23 13:10:51,266 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 122 states. [2018-11-23 13:10:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:51,270 INFO L93 Difference]: Finished difference Result 122 states and 166 transitions. [2018-11-23 13:10:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2018-11-23 13:10:51,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:10:51,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:10:51,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:10:51,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:10:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:10:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-23 13:10:51,273 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-11-23 13:10:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:51,273 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-23 13:10:51,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 13:10:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-23 13:10:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:10:51,274 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:51,274 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:51,274 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:10:51,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash 288813869, now seen corresponding path program 14 times [2018-11-23 13:10:51,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:51,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:52,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {6083#true} call ULTIMATE.init(); {6083#true} is VALID [2018-11-23 13:10:52,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {6083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6083#true} is VALID [2018-11-23 13:10:52,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {6083#true} assume true; {6083#true} is VALID [2018-11-23 13:10:52,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6083#true} {6083#true} #54#return; {6083#true} is VALID [2018-11-23 13:10:52,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {6083#true} call #t~ret5 := main(); {6083#true} is VALID [2018-11-23 13:10:52,107 INFO L273 TraceCheckUtils]: 5: Hoare triple {6083#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {6085#(= main_~index~0 0)} is VALID [2018-11-23 13:10:52,108 INFO L273 TraceCheckUtils]: 6: Hoare triple {6085#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6086#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:10:52,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {6086#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6087#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:10:52,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {6087#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6088#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:10:52,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {6088#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6089#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:10:52,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {6089#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6090#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:10:52,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {6090#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6091#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:10:52,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {6091#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6092#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:10:52,120 INFO L273 TraceCheckUtils]: 13: Hoare triple {6092#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6093#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:10:52,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {6093#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6094#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} is VALID [2018-11-23 13:10:52,124 INFO L273 TraceCheckUtils]: 15: Hoare triple {6094#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6095#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} is VALID [2018-11-23 13:10:52,125 INFO L273 TraceCheckUtils]: 16: Hoare triple {6095#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6096#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} is VALID [2018-11-23 13:10:52,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {6096#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6097#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967283) 4294967296)) 12) main_~index~0)} is VALID [2018-11-23 13:10:52,129 INFO L273 TraceCheckUtils]: 18: Hoare triple {6097#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967283) 4294967296)) 12) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6098#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967282) 4294967296)) 13) main_~index~0)} is VALID [2018-11-23 13:10:52,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {6098#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967282) 4294967296)) 13) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6099#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 14))} is VALID [2018-11-23 13:10:52,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {6099#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 14))} assume !(~index~0 % 4294967296 < 10000); {6084#false} is VALID [2018-11-23 13:10:52,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {6084#false} ~index~0 := 0; {6084#false} is VALID [2018-11-23 13:10:52,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {6084#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {6084#false} is VALID [2018-11-23 13:10:52,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {6084#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {6084#false} is VALID [2018-11-23 13:10:52,133 INFO L256 TraceCheckUtils]: 24: Hoare triple {6084#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {6084#false} is VALID [2018-11-23 13:10:52,133 INFO L273 TraceCheckUtils]: 25: Hoare triple {6084#false} ~cond := #in~cond; {6084#false} is VALID [2018-11-23 13:10:52,133 INFO L273 TraceCheckUtils]: 26: Hoare triple {6084#false} assume 0 == ~cond; {6084#false} is VALID [2018-11-23 13:10:52,134 INFO L273 TraceCheckUtils]: 27: Hoare triple {6084#false} assume !false; {6084#false} is VALID [2018-11-23 13:10:52,135 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:52,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:10:52,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:10:52,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:10:52,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:10:52,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:10:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:52,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:10:53,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {6083#true} call ULTIMATE.init(); {6083#true} is VALID [2018-11-23 13:10:53,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {6083#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6083#true} is VALID [2018-11-23 13:10:53,961 INFO L273 TraceCheckUtils]: 2: Hoare triple {6083#true} assume true; {6083#true} is VALID [2018-11-23 13:10:53,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6083#true} {6083#true} #54#return; {6083#true} is VALID [2018-11-23 13:10:53,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {6083#true} call #t~ret5 := main(); {6083#true} is VALID [2018-11-23 13:10:53,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {6083#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {6085#(= main_~index~0 0)} is VALID [2018-11-23 13:10:53,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {6085#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6086#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:10:53,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {6086#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6124#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} is VALID [2018-11-23 13:10:53,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {6124#(and (< 0 (+ (div (+ main_~index~0 (- 1)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 1)) 4294967296)) 4294967293) 4294967296)) 2) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6128#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} is VALID [2018-11-23 13:10:53,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {6128#(and (< 0 (+ (div (+ main_~index~0 (- 2)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 2)) 4294967296)) 4294967292) 4294967296)) 3) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6132#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} is VALID [2018-11-23 13:10:53,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {6132#(and (< 0 (+ (div (+ main_~index~0 (- 3)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 3)) 4294967296)) 4294967291) 4294967296)) 4) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6136#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} is VALID [2018-11-23 13:10:53,984 INFO L273 TraceCheckUtils]: 11: Hoare triple {6136#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 4)) 4294967296)) 4294967290) 4294967296)) 5) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 4)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6140#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} is VALID [2018-11-23 13:10:53,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {6140#(and (< 0 (+ (div (+ main_~index~0 (- 5)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 5)) 4294967296)) 4294967289) 4294967296)) 6) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6144#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} is VALID [2018-11-23 13:10:53,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {6144#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 6)) 4294967296)) 4294967288) 4294967296)) 7) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 6)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6148#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} is VALID [2018-11-23 13:10:53,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {6148#(and (< 0 (+ (div (+ main_~index~0 (- 7)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 7)) 4294967296)) 4294967287) 4294967296)) 8) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6152#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} is VALID [2018-11-23 13:10:53,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {6152#(and (< 0 (+ (div (+ main_~index~0 (- 8)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 8)) 4294967296)) 4294967286) 4294967296)) 9) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6156#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} is VALID [2018-11-23 13:10:54,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {6156#(and (< 0 (+ (div (+ main_~index~0 (- 9)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 9)) 4294967296)) 4294967285) 4294967296)) 10) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6160#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} is VALID [2018-11-23 13:10:54,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {6160#(and (< 0 (+ (div (+ main_~index~0 (- 10)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 10)) 4294967296)) 4294967284) 4294967296)) 11) main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6164#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 11)) 4294967296)) 4294967283) 4294967296)) 12) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 11)) 4294967296) 1)))} is VALID [2018-11-23 13:10:54,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {6164#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 11)) 4294967296)) 4294967283) 4294967296)) 12) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 11)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6168#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 12)) 4294967296)) 4294967282) 4294967296)) 13) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 12)) 4294967296) 1)))} is VALID [2018-11-23 13:10:54,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {6168#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 12)) 4294967296)) 4294967282) 4294967296)) 13) main_~index~0) (< 0 (+ (div (+ main_~index~0 (- 12)) 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6172#(and (< 0 (+ (div (+ main_~index~0 (- 13)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 13)) 4294967296)) 4294967281) 4294967296)) 14) main_~index~0))} is VALID [2018-11-23 13:10:54,025 INFO L273 TraceCheckUtils]: 20: Hoare triple {6172#(and (< 0 (+ (div (+ main_~index~0 (- 13)) 4294967296) 1)) (<= (+ (* 4294967296 (div (+ main_~index~0 (* 4294967296 (div (+ main_~index~0 (- 13)) 4294967296)) 4294967281) 4294967296)) 14) main_~index~0))} assume !(~index~0 % 4294967296 < 10000); {6084#false} is VALID [2018-11-23 13:10:54,025 INFO L273 TraceCheckUtils]: 21: Hoare triple {6084#false} ~index~0 := 0; {6084#false} is VALID [2018-11-23 13:10:54,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {6084#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {6084#false} is VALID [2018-11-23 13:10:54,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {6084#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {6084#false} is VALID [2018-11-23 13:10:54,025 INFO L256 TraceCheckUtils]: 24: Hoare triple {6084#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {6084#false} is VALID [2018-11-23 13:10:54,026 INFO L273 TraceCheckUtils]: 25: Hoare triple {6084#false} ~cond := #in~cond; {6084#false} is VALID [2018-11-23 13:10:54,026 INFO L273 TraceCheckUtils]: 26: Hoare triple {6084#false} assume 0 == ~cond; {6084#false} is VALID [2018-11-23 13:10:54,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {6084#false} assume !false; {6084#false} is VALID [2018-11-23 13:10:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:10:54,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:10:54,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-11-23 13:10:54,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-11-23 13:10:54,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:10:54,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 13:10:54,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:10:54,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 13:10:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 13:10:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:10:54,179 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 30 states. [2018-11-23 13:11:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,355 INFO L93 Difference]: Finished difference Result 146 states and 195 transitions. [2018-11-23 13:11:05,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:11:05,355 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 28 [2018-11-23 13:11:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:11:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:11:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 155 transitions. [2018-11-23 13:11:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:11:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 155 transitions. [2018-11-23 13:11:05,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 155 transitions. [2018-11-23 13:11:05,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:05,784 INFO L225 Difference]: With dead ends: 146 [2018-11-23 13:11:05,784 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 13:11:05,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-11-23 13:11:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 13:11:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 39. [2018-11-23 13:11:05,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:11:05,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 39 states. [2018-11-23 13:11:05,861 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 39 states. [2018-11-23 13:11:05,861 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 39 states. [2018-11-23 13:11:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,866 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2018-11-23 13:11:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2018-11-23 13:11:05,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:05,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:05,867 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 129 states. [2018-11-23 13:11:05,867 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 129 states. [2018-11-23 13:11:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:11:05,871 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2018-11-23 13:11:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2018-11-23 13:11:05,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:11:05,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:11:05,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:11:05,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:11:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 13:11:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-11-23 13:11:05,873 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 28 [2018-11-23 13:11:05,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:11:05,874 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-11-23 13:11:05,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 13:11:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-11-23 13:11:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:11:05,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:11:05,874 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:11:05,875 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:11:05,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:11:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash 499618109, now seen corresponding path program 15 times [2018-11-23 13:11:05,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:11:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:11:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:05,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:11:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:11:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:06,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 13:11:06,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 13:11:06,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 13:11:06,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #54#return; {6739#true} is VALID [2018-11-23 13:11:06,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret5 := main(); {6739#true} is VALID [2018-11-23 13:11:06,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {6741#(= main_~index~0 0)} is VALID [2018-11-23 13:11:06,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {6741#(= main_~index~0 0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6742#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} is VALID [2018-11-23 13:11:06,381 INFO L273 TraceCheckUtils]: 7: Hoare triple {6742#(and (<= (+ (* 4294967296 (div (+ main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 4294967294)) 4294967296)) 1) main_~index~0) (< 0 (+ (div main_~index~0 4294967296) 1)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6743#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} is VALID [2018-11-23 13:11:06,382 INFO L273 TraceCheckUtils]: 8: Hoare triple {6743#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967293) 4294967296)) 2) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6744#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} is VALID [2018-11-23 13:11:06,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {6744#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967292) 4294967296)) 3) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6745#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} is VALID [2018-11-23 13:11:06,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {6745#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967291) 4294967296)) 4) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6746#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} is VALID [2018-11-23 13:11:06,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {6746#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967290) 4294967296)) 5) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6747#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} is VALID [2018-11-23 13:11:06,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {6747#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967289) 4294967296)) 6) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6748#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} is VALID [2018-11-23 13:11:06,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {6748#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967288) 4294967296)) 7) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6749#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} is VALID [2018-11-23 13:11:06,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {6749#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967287) 4294967296)) 8) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6750#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} is VALID [2018-11-23 13:11:06,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {6750#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967286) 4294967296)) 9) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6751#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} is VALID [2018-11-23 13:11:06,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {6751#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967285) 4294967296)) 10) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6752#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} is VALID [2018-11-23 13:11:06,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {6752#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967284) 4294967296)) 11) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6753#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967283) 4294967296)) 12) main_~index~0)} is VALID [2018-11-23 13:11:06,417 INFO L273 TraceCheckUtils]: 18: Hoare triple {6753#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967283) 4294967296)) 12) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6754#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967282) 4294967296)) 13) main_~index~0)} is VALID [2018-11-23 13:11:06,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {6754#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967282) 4294967296)) 13) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6755#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967281) 4294967296)) 14) main_~index~0)} is VALID [2018-11-23 13:11:06,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {6755#(<= (+ (* 4294967296 (div (+ main_~index~0 4294967281) 4294967296)) 14) main_~index~0)} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6756#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 15))} is VALID [2018-11-23 13:11:06,421 INFO L273 TraceCheckUtils]: 21: Hoare triple {6756#(<= main_~index~0 (+ (* 4294967296 (div main_~index~0 4294967296)) 15))} assume !(~index~0 % 4294967296 < 10000); {6740#false} is VALID [2018-11-23 13:11:06,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {6740#false} ~index~0 := 0; {6740#false} is VALID [2018-11-23 13:11:06,421 INFO L273 TraceCheckUtils]: 23: Hoare triple {6740#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {6740#false} is VALID [2018-11-23 13:11:06,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {6740#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {6740#false} is VALID [2018-11-23 13:11:06,422 INFO L256 TraceCheckUtils]: 25: Hoare triple {6740#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {6740#false} is VALID [2018-11-23 13:11:06,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 13:11:06,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 13:11:06,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 13:11:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:06,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:11:06,424 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:11:06,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:11:45,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:11:45,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:11:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:11:45,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:11:45,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:11:45,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:11:45,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-11-23 13:11:45,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 13:11:45,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 13:11:45,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-11-23 13:11:45,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-23 13:11:45,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 78 [2018-11-23 13:11:45,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-23 13:11:45,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-23 13:11:45,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-11-23 13:11:45,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-11-23 13:11:45,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-11-23 13:11:45,884 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:45,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 244 [2018-11-23 13:11:45,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:45,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2018-11-23 13:11:46,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-11-23 13:11:46,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 363 [2018-11-23 13:11:46,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:46,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:46,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:46,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2018-11-23 13:11:46,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 51 [2018-11-23 13:11:46,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 506 [2018-11-23 13:11:46,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:46,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:46,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:46,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:75, output treesize:71 [2018-11-23 13:11:46,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 58 [2018-11-23 13:11:46,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,738 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,781 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,828 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,838 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:46,840 INFO L303 Elim1Store]: Index analysis took 126 ms [2018-11-23 13:11:46,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 673 [2018-11-23 13:11:46,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:47,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:47,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:47,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-11-23 13:11:47,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 65 [2018-11-23 13:11:47,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,208 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,213 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,218 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,219 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,220 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,222 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,226 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,230 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,232 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,237 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,238 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,243 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,245 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,248 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,249 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,254 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 72 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 864 [2018-11-23 13:11:47,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:47,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:47,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:93, output treesize:89 [2018-11-23 13:11:47,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 72 [2018-11-23 13:11:47,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,861 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:47,949 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-11-23 13:11:47,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 90 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 1079 [2018-11-23 13:11:47,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:48,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:48,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:48,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:102, output treesize:98 [2018-11-23 13:11:48,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 79 [2018-11-23 13:11:48,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,521 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,526 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,552 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,580 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,582 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:48,626 INFO L303 Elim1Store]: Index analysis took 134 ms [2018-11-23 13:11:48,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 110 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 1318 [2018-11-23 13:11:48,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:49,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:49,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:49,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:111, output treesize:107 [2018-11-23 13:11:49,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 86 [2018-11-23 13:11:49,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,375 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,497 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,514 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,518 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:49,544 INFO L303 Elim1Store]: Index analysis took 173 ms [2018-11-23 13:11:49,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 132 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 1581 [2018-11-23 13:11:49,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:50,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:50,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:50,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:117, output treesize:113 [2018-11-23 13:11:50,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 93 [2018-11-23 13:11:50,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,585 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,590 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,633 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,638 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,639 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,641 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,665 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,741 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,748 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,769 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,788 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:50,810 INFO L303 Elim1Store]: Index analysis took 228 ms [2018-11-23 13:11:50,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 144 disjoint index pairs (out of 66 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 1750 [2018-11-23 13:11:50,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:51,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:51,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:51,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:124 [2018-11-23 13:11:51,682 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:51,683 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, v_main_~tmp~0_17]. (let ((.cse0 (select |v_#memory_int_20| |main_~#array~0.base|))) (and (= (store |v_#memory_int_20| |main_~#array~0.base| (store .cse0 (+ |main_~#array~0.offset| 48) v_main_~tmp~0_17)) |#memory_int|) (= 6 (select .cse0 (+ |main_~#array~0.offset| 12))) (= 18 (select .cse0 (+ |main_~#array~0.offset| 36))) (= (select .cse0 (+ |main_~#array~0.offset| 32)) 16) (= 2 (select .cse0 (+ |main_~#array~0.offset| 4))) (= 0 |main_~#array~0.offset|) (= 4 (select .cse0 (+ |main_~#array~0.offset| 8))) (= (select .cse0 (+ |main_~#array~0.offset| 24)) 12) (= (select .cse0 (+ |main_~#array~0.offset| 16)) 8) (= (select .cse0 (+ |main_~#array~0.offset| 40)) 20) (= (select .cse0 (+ |main_~#array~0.offset| 20)) 10) (<= (+ v_main_~tmp~0_17 2) main_~tmp~0) (= 0 (select .cse0 |main_~#array~0.offset|)) (= (select .cse0 (+ |main_~#array~0.offset| 28)) 14) (= 22 (select .cse0 (+ |main_~#array~0.offset| 44))) (= 13 main_~index~0))) [2018-11-23 13:11:51,683 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (and (= 6 (select .cse0 (+ |main_~#array~0.offset| 12))) (= (select .cse0 (+ |main_~#array~0.offset| 20)) 10) (= (select .cse0 (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select .cse0 (+ |main_~#array~0.offset| 36))) (<= (+ (select .cse0 (+ |main_~#array~0.offset| 48)) 2) main_~tmp~0) (= (select .cse0 (+ |main_~#array~0.offset| 28)) 14) (= 2 (select .cse0 (+ |main_~#array~0.offset| 4))) (= 16 (select .cse0 (+ |main_~#array~0.offset| 32))) (= 12 (select .cse0 (+ |main_~#array~0.offset| 24))) (= (select .cse0 (+ |main_~#array~0.offset| 8)) 4) (= (select .cse0 (+ |main_~#array~0.offset| 40)) 20) (= 0 (select .cse0 |main_~#array~0.offset|)) (= (select .cse0 (+ |main_~#array~0.offset| 44)) 22) (= 13 main_~index~0))) [2018-11-23 13:11:51,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 102 [2018-11-23 13:11:51,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,890 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,904 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,920 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,944 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,946 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,947 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,953 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,954 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,986 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:51,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,021 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,038 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,039 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,065 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,066 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,076 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,084 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,106 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:52,144 INFO L303 Elim1Store]: Index analysis took 261 ms [2018-11-23 13:11:52,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 158 disjoint index pairs (out of 78 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 1873 [2018-11-23 13:11:52,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:53,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:53,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:53,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:130 [2018-11-23 13:11:53,162 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:53,163 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~tmp~0_18]. (let ((.cse0 (select |v_#memory_int_21| |main_~#array~0.base|))) (and (= 0 (select .cse0 |main_~#array~0.offset|)) (= (select .cse0 (+ |main_~#array~0.offset| 24)) 12) (= 16 (select .cse0 (+ |main_~#array~0.offset| 32))) (= 0 |main_~#array~0.offset|) (= 14 (select .cse0 (+ |main_~#array~0.offset| 28))) (= (store |v_#memory_int_21| |main_~#array~0.base| (store .cse0 (+ |main_~#array~0.offset| 52) v_main_~tmp~0_18)) |#memory_int|) (<= (+ (select .cse0 (+ |main_~#array~0.offset| 48)) 2) v_main_~tmp~0_18) (= (select .cse0 (+ |main_~#array~0.offset| 12)) 6) (= 14 main_~index~0) (= (select .cse0 (+ |main_~#array~0.offset| 16)) 8) (= 20 (select .cse0 (+ |main_~#array~0.offset| 40))) (= 2 (select .cse0 (+ |main_~#array~0.offset| 4))) (= 22 (select .cse0 (+ |main_~#array~0.offset| 44))) (= (select .cse0 (+ |main_~#array~0.offset| 36)) 18) (= (select .cse0 (+ |main_~#array~0.offset| 8)) 4) (= (select .cse0 (+ |main_~#array~0.offset| 20)) 10))) [2018-11-23 13:11:53,163 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (and (= 6 (select .cse0 (+ |main_~#array~0.offset| 12))) (= (select .cse0 (+ |main_~#array~0.offset| 20)) 10) (= (select .cse0 (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 14 main_~index~0) (= 18 (select .cse0 (+ |main_~#array~0.offset| 36))) (<= (+ (select .cse0 (+ |main_~#array~0.offset| 48)) 2) (select .cse0 (+ |main_~#array~0.offset| 52))) (= (select .cse0 (+ |main_~#array~0.offset| 28)) 14) (= 2 (select .cse0 (+ |main_~#array~0.offset| 4))) (= 16 (select .cse0 (+ |main_~#array~0.offset| 32))) (= 12 (select .cse0 (+ |main_~#array~0.offset| 24))) (= (select .cse0 (+ |main_~#array~0.offset| 8)) 4) (= (select .cse0 (+ |main_~#array~0.offset| 40)) 20) (= 0 (select .cse0 |main_~#array~0.offset|)) (= (select .cse0 (+ |main_~#array~0.offset| 44)) 22))) [2018-11-23 13:11:53,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 106 [2018-11-23 13:11:53,325 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,327 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,328 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,336 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,338 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,362 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,443 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,475 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,500 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,502 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,510 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,516 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,537 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,545 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,550 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,554 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,568 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,571 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,591 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:11:53,601 INFO L303 Elim1Store]: Index analysis took 279 ms [2018-11-23 13:11:53,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 172 disjoint index pairs (out of 91 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 1995 [2018-11-23 13:11:53,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:11:54,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:54,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:11:54,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:143, output treesize:130 [2018-11-23 13:11:54,766 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:11:54,766 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, v_main_~tmp~0_19]. (let ((.cse0 (select |v_#memory_int_22| |main_~#array~0.base|))) (and (= 0 (select .cse0 |main_~#array~0.offset|)) (= 22 (select .cse0 (+ |main_~#array~0.offset| 44))) (= 0 |main_~#array~0.offset|) (<= (+ (select .cse0 (+ |main_~#array~0.offset| 48)) 2) (select .cse0 (+ |main_~#array~0.offset| 52))) (= 4 (select .cse0 (+ |main_~#array~0.offset| 8))) (= 8 (select .cse0 (+ |main_~#array~0.offset| 16))) (= 15 main_~index~0) (= |#memory_int| (store |v_#memory_int_22| |main_~#array~0.base| (store .cse0 (+ |main_~#array~0.offset| 56) v_main_~tmp~0_19))) (= 14 (select .cse0 (+ |main_~#array~0.offset| 28))) (= 18 (select .cse0 (+ |main_~#array~0.offset| 36))) (= (select .cse0 (+ |main_~#array~0.offset| 32)) 16) (= 20 (select .cse0 (+ |main_~#array~0.offset| 40))) (= 10 (select .cse0 (+ |main_~#array~0.offset| 20))) (= (select .cse0 (+ |main_~#array~0.offset| 12)) 6) (= 2 (select .cse0 (+ |main_~#array~0.offset| 4))) (= (select .cse0 (+ |main_~#array~0.offset| 24)) 12))) [2018-11-23 13:11:54,766 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |main_~#array~0.base|))) (and (= 6 (select .cse0 (+ |main_~#array~0.offset| 12))) (= (select .cse0 (+ |main_~#array~0.offset| 20)) 10) (= (select .cse0 (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 15 main_~index~0) (= 18 (select .cse0 (+ |main_~#array~0.offset| 36))) (<= (+ (select .cse0 (+ |main_~#array~0.offset| 48)) 2) (select .cse0 (+ |main_~#array~0.offset| 52))) (= (select .cse0 (+ |main_~#array~0.offset| 28)) 14) (= 2 (select .cse0 (+ |main_~#array~0.offset| 4))) (= 16 (select .cse0 (+ |main_~#array~0.offset| 32))) (= 12 (select .cse0 (+ |main_~#array~0.offset| 24))) (= (select .cse0 (+ |main_~#array~0.offset| 8)) 4) (= (select .cse0 (+ |main_~#array~0.offset| 40)) 20) (= 0 (select .cse0 |main_~#array~0.offset|)) (= (select .cse0 (+ |main_~#array~0.offset| 44)) 22))) [2018-11-23 13:11:54,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {6739#true} call ULTIMATE.init(); {6739#true} is VALID [2018-11-23 13:11:54,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {6739#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6739#true} is VALID [2018-11-23 13:11:54,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {6739#true} assume true; {6739#true} is VALID [2018-11-23 13:11:54,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6739#true} {6739#true} #54#return; {6739#true} is VALID [2018-11-23 13:11:54,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {6739#true} call #t~ret5 := main(); {6739#true} is VALID [2018-11-23 13:11:54,956 INFO L273 TraceCheckUtils]: 5: Hoare triple {6739#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(40000);~index~0 := 0;~tmp~0 := 0; {6775#(and (= main_~tmp~0 0) (= 0 |main_~#array~0.offset|) (= 0 main_~index~0))} is VALID [2018-11-23 13:11:54,958 INFO L273 TraceCheckUtils]: 6: Hoare triple {6775#(and (= main_~tmp~0 0) (= 0 |main_~#array~0.offset|) (= 0 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6779#(and (= 1 main_~index~0) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~tmp~0 2))} is VALID [2018-11-23 13:11:54,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {6779#(and (= 1 main_~index~0) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~tmp~0 2))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6783#(and (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= main_~tmp~0 4) (= 0 |main_~#array~0.offset|) (= 2 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {6783#(and (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= main_~tmp~0 4) (= 0 |main_~#array~0.offset|) (= 2 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6787#(and (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= main_~tmp~0 6) (= 0 |main_~#array~0.offset|) (= 3 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {6787#(and (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= main_~tmp~0 6) (= 0 |main_~#array~0.offset|) (= 3 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6791#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 4 main_~index~0) (= 0 |main_~#array~0.offset|) (= main_~tmp~0 8) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {6791#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 4 main_~index~0) (= 0 |main_~#array~0.offset|) (= main_~tmp~0 8) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6795#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= main_~tmp~0 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 5 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,967 INFO L273 TraceCheckUtils]: 11: Hoare triple {6795#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= main_~tmp~0 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 5 main_~index~0) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6799#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= main_~tmp~0 12) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= 6 main_~index~0))} is VALID [2018-11-23 13:11:54,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {6799#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= main_~tmp~0 12) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= 6 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6803#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= main_~tmp~0 14) (= 7 main_~index~0) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {6803#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= main_~tmp~0 14) (= 7 main_~index~0) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6807#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= main_~tmp~0 16) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 8 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {6807#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= main_~tmp~0 16) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 8 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6811#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= 9 main_~index~0) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~tmp~0 18))} is VALID [2018-11-23 13:11:54,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {6811#(and (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= 9 main_~index~0) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= main_~tmp~0 18))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6815#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 10 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= main_~tmp~0 20) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {6815#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= 10 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= main_~tmp~0 20) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6819#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= main_~tmp~0 22) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 11 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {6819#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= main_~tmp~0 22) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= 11 main_~index~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6823#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= 12 main_~index~0))} is VALID [2018-11-23 13:11:54,985 INFO L273 TraceCheckUtils]: 18: Hoare triple {6823#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= 12 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6827#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 48)) 2) main_~tmp~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= 13 main_~index~0))} is VALID [2018-11-23 13:11:54,987 INFO L273 TraceCheckUtils]: 19: Hoare triple {6827#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 48)) 2) main_~tmp~0) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)) (= 13 main_~index~0))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6831#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 14 main_~index~0) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 48)) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 52))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,991 INFO L273 TraceCheckUtils]: 20: Hoare triple {6831#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 14 main_~index~0) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 48)) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 52))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !!(~index~0 % 4294967296 < 10000);call write~int(~tmp~0, ~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);~index~0 := 1 + ~index~0;~tmp~0 := 2 + ~tmp~0; {6835#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 15 main_~index~0) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 48)) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 52))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} is VALID [2018-11-23 13:11:54,992 INFO L273 TraceCheckUtils]: 21: Hoare triple {6835#(and (= 6 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 12))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 20)) 10) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 16)) 8) (= 0 |main_~#array~0.offset|) (= 15 main_~index~0) (= 18 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 36))) (<= (+ (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 48)) 2) (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 52))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 28)) 14) (= 16 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 32))) (= 2 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 4))) (= 12 (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 24))) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 8)) 4) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 40)) 20) (= (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| 44)) 22) (= 0 (select (select |#memory_int| |main_~#array~0.base|) |main_~#array~0.offset|)))} assume !(~index~0 % 4294967296 < 10000); {6740#false} is VALID [2018-11-23 13:11:54,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {6740#false} ~index~0 := 0; {6740#false} is VALID [2018-11-23 13:11:54,992 INFO L273 TraceCheckUtils]: 23: Hoare triple {6740#false} assume !!(~index~0 % 4294967296 < 10000);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := #t~mem2 % 4294967296 == 2 * ~index~0 % 4294967296; {6740#false} is VALID [2018-11-23 13:11:54,993 INFO L273 TraceCheckUtils]: 24: Hoare triple {6740#false} assume !#t~short4;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~index~0 % 4294967296 % 4294967296 <= 2147483647 then ~index~0 % 4294967296 % 4294967296 else ~index~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short4 := 0 == #t~mem3 % 4294967296; {6740#false} is VALID [2018-11-23 13:11:54,993 INFO L256 TraceCheckUtils]: 25: Hoare triple {6740#false} call __VERIFIER_assert((if #t~short4 then 1 else 0)); {6740#false} is VALID [2018-11-23 13:11:54,993 INFO L273 TraceCheckUtils]: 26: Hoare triple {6740#false} ~cond := #in~cond; {6740#false} is VALID [2018-11-23 13:11:54,993 INFO L273 TraceCheckUtils]: 27: Hoare triple {6740#false} assume 0 == ~cond; {6740#false} is VALID [2018-11-23 13:11:54,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {6740#false} assume !false; {6740#false} is VALID [2018-11-23 13:11:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:11:55,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:11:55,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-11-23 13:11:55,008 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 29 [2018-11-23 13:11:55,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:11:55,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 13:11:55,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:11:55,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 13:11:55,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 13:11:55,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:11:55,088 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 34 states.