/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:04:32,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:04:32,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:04:32,043 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:04:32,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:04:32,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:04:32,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:04:32,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:04:32,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:04:32,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:04:32,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:04:32,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:04:32,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:04:32,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:04:32,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:04:32,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:04:32,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:04:32,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:04:32,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:04:32,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:04:32,057 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:04:32,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:04:32,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:04:32,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:04:32,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:04:32,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:04:32,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:04:32,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:04:32,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:04:32,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:04:32,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:04:32,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:04:32,065 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:04:32,065 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:04:32,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:04:32,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:04:32,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:04:32,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:04:32,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:04:32,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:04:32,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:04:32,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:04:32,069 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:04:32,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:04:32,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:04:32,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:04:32,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:04:32,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:04:32,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:04:32,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:04:32,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:04:32,084 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:04:32,084 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:04:32,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:04:32,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:04:32,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:04:32,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:04:32,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:04:32,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:04:32,087 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:04:32,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:04:32,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:04:32,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:04:32,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:04:32,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:04:32,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:04:32,275 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:04:32,276 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:04:32,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-27 11:04:32,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e723f8a/2070f8e60b14435686c1635a636db889/FLAGc7d2ebf3c [2022-04-27 11:04:32,688 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:04:32,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-27 11:04:32,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e723f8a/2070f8e60b14435686c1635a636db889/FLAGc7d2ebf3c [2022-04-27 11:04:32,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44e723f8a/2070f8e60b14435686c1635a636db889 [2022-04-27 11:04:32,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:04:32,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:04:32,709 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:04:32,709 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:04:32,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:04:32,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c100c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32, skipping insertion in model container [2022-04-27 11:04:32,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,717 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:04:32,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:04:32,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-27 11:04:32,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:04:32,836 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:04:32,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-27 11:04:32,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:04:32,853 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:04:32,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32 WrapperNode [2022-04-27 11:04:32,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:04:32,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:04:32,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:04:32,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:04:32,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:04:32,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:04:32,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:04:32,872 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:04:32,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (1/1) ... [2022-04-27 11:04:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:04:32,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:32,895 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:04:32,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:04:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:04:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:04:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:04:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:04:32,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:04:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:04:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:04:32,923 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:04:32,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:04:32,968 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:04:32,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:04:33,060 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:04:33,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:04:33,064 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:04:33,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:04:33 BoogieIcfgContainer [2022-04-27 11:04:33,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:04:33,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:04:33,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:04:33,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:04:33,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:04:32" (1/3) ... [2022-04-27 11:04:33,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187858c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:04:33, skipping insertion in model container [2022-04-27 11:04:33,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:04:32" (2/3) ... [2022-04-27 11:04:33,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187858c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:04:33, skipping insertion in model container [2022-04-27 11:04:33,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:04:33" (3/3) ... [2022-04-27 11:04:33,071 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2022-04-27 11:04:33,080 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:04:33,080 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:04:33,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:04:33,111 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@23e2cd91, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40d8e5f7 [2022-04-27 11:04:33,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:04:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:04:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:04:33,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:33,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:33,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:33,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-27 11:04:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:33,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352589771] [2022-04-27 11:04:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:33,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-27 11:04:33,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:04:33,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-27 11:04:33,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:33,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-27 11:04:33,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 11:04:33,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-27 11:04:33,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-27 11:04:33,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {24#true} is VALID [2022-04-27 11:04:33,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-27 11:04:33,243 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-27 11:04:33,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 11:04:33,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 11:04:33,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 11:04:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:33,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:33,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352589771] [2022-04-27 11:04:33,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352589771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:04:33,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:04:33,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:04:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573552741] [2022-04-27 11:04:33,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:04:33,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:04:33,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:33,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:33,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:04:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:04:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:04:33,305 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:33,370 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-27 11:04:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:04:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:04:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 11:04:33,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 11:04:33,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 11:04:33,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:33,422 INFO L225 Difference]: With dead ends: 33 [2022-04-27 11:04:33,422 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:04:33,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:04:33,428 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:33,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:04:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:04:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:04:33,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:33,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,451 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,452 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:33,453 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:04:33,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:04:33,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:33,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:33,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:04:33,454 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 11:04:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:33,456 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:04:33,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:04:33,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:33,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:33,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:33,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 11:04:33,459 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 11:04:33,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:33,459 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 11:04:33,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:04:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:04:33,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:33,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:33,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:04:33,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:33,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-27 11:04:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:33,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112881694] [2022-04-27 11:04:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-04-27 11:04:33,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 11:04:33,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123#true} {123#true} #42#return; {123#true} is VALID [2022-04-27 11:04:33,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {123#true} call ULTIMATE.init(); {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:33,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {123#true} is VALID [2022-04-27 11:04:33,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {123#true} assume true; {123#true} is VALID [2022-04-27 11:04:33,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123#true} {123#true} #42#return; {123#true} is VALID [2022-04-27 11:04:33,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {123#true} call #t~ret6 := main(); {123#true} is VALID [2022-04-27 11:04:33,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {123#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-27 11:04:33,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {124#false} is VALID [2022-04-27 11:04:33,600 INFO L272 TraceCheckUtils]: 7: Hoare triple {124#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {124#false} is VALID [2022-04-27 11:04:33,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} ~cond := #in~cond; {124#false} is VALID [2022-04-27 11:04:33,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#false} assume 0 == ~cond; {124#false} is VALID [2022-04-27 11:04:33,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-04-27 11:04:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:33,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:33,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112881694] [2022-04-27 11:04:33,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112881694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:04:33,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:04:33,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:04:33,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084423942] [2022-04-27 11:04:33,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:04:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:04:33,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:33,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:33,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:04:33,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:04:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:04:33,615 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:33,686 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 11:04:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:04:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 11:04:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:33,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 11:04:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-27 11:04:33,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-27 11:04:33,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:33,719 INFO L225 Difference]: With dead ends: 25 [2022-04-27 11:04:33,719 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:04:33,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:04:33,724 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:33,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:04:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:04:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-27 11:04:33,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:33,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,733 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,733 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:33,739 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:04:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 11:04:33,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:33,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:33,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:04:33,740 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-27 11:04:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:33,741 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-27 11:04:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-27 11:04:33,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:33,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:33,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:33,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-27 11:04:33,742 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-27 11:04:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:33,742 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-27 11:04:33,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-27 11:04:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:04:33,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:33,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:33,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:04:33,743 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:33,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2022-04-27 11:04:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:33,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403416768] [2022-04-27 11:04:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:33,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:04:33,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:04:33,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:04:33,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:33,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:04:33,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:04:33,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:04:33,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:04:33,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 11:04:33,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 11:04:33,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} assume !(~x~0 % 4294967296 >= 5000000); {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} is VALID [2022-04-27 11:04:33,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(and (= main_~x~0 0) (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= 10000000 main_~y~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {234#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:04:33,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999999 main_~x~0) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {229#false} is VALID [2022-04-27 11:04:33,919 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {229#false} is VALID [2022-04-27 11:04:33,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2022-04-27 11:04:33,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:04:33,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:04:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:33,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403416768] [2022-04-27 11:04:33,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403416768] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:33,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348928165] [2022-04-27 11:04:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:33,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:33,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:33,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:33,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:04:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:04:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:33,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:34,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-27 11:04:34,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:04:34,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:04:34,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:04:34,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:04:34,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:34,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:34,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:34,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {254#(and (= main_~x~0 0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:34,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:34,125 INFO L272 TraceCheckUtils]: 10: Hoare triple {264#(and (= main_~x~0 1) (= 5000000 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:34,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:34,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:04:34,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:04:34,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:34,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:04:34,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:04:34,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {275#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:04:34,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {271#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {275#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:34,254 INFO L272 TraceCheckUtils]: 10: Hoare triple {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {271#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:34,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:34,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {291#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:34,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:34,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:34,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {298#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:34,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:04:34,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #42#return; {228#true} is VALID [2022-04-27 11:04:34,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:04:34,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228#true} is VALID [2022-04-27 11:04:34,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2022-04-27 11:04:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:34,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348928165] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:04:34,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:04:34,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-27 11:04:34,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072206547] [2022-04-27 11:04:34,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:04:34,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:04:34,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:34,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:34,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:04:34,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:34,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:04:34,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:04:34,284 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:34,611 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-27 11:04:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:04:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:04:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-27 11:04:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-27 11:04:34,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-27 11:04:34,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:34,675 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:04:34,675 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 11:04:34,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:04:34,676 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:34,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 41 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:04:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 11:04:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-27 11:04:34,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:34,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,682 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,682 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:34,683 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 11:04:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 11:04:34,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:34,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:34,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 11:04:34,684 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-27 11:04:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:34,685 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-27 11:04:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-27 11:04:34,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:34,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:34,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:34,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-27 11:04:34,686 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-27 11:04:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:34,687 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-27 11:04:34,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-27 11:04:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:04:34,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:34,687 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:34,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:04:34,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:34,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:34,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1178357594, now seen corresponding path program 1 times [2022-04-27 11:04:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:34,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274389507] [2022-04-27 11:04:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:34,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:34,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {485#true} is VALID [2022-04-27 11:04:34,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 11:04:34,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {485#true} {485#true} #42#return; {485#true} is VALID [2022-04-27 11:04:34,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:34,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {485#true} is VALID [2022-04-27 11:04:34,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 11:04:34,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #42#return; {485#true} is VALID [2022-04-27 11:04:34,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret6 := main(); {485#true} is VALID [2022-04-27 11:04:34,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {490#(= main_~x~0 0)} is VALID [2022-04-27 11:04:34,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {490#(= main_~x~0 0)} is VALID [2022-04-27 11:04:34,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {490#(= main_~x~0 0)} is VALID [2022-04-27 11:04:34,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:34,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:34,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:34,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:34,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:34,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {492#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {486#false} is VALID [2022-04-27 11:04:34,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {486#false} is VALID [2022-04-27 11:04:34,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {486#false} is VALID [2022-04-27 11:04:34,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#false} assume !(~x~0 % 4294967296 >= 5000000); {486#false} is VALID [2022-04-27 11:04:34,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {486#false} is VALID [2022-04-27 11:04:34,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {486#false} is VALID [2022-04-27 11:04:35,000 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {486#false} is VALID [2022-04-27 11:04:35,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2022-04-27 11:04:35,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2022-04-27 11:04:35,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-04-27 11:04:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:04:35,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274389507] [2022-04-27 11:04:35,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274389507] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:35,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521859900] [2022-04-27 11:04:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:35,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:35,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:35,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:04:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:35,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:04:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:35,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:35,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2022-04-27 11:04:35,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {485#true} is VALID [2022-04-27 11:04:35,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 11:04:35,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #42#return; {485#true} is VALID [2022-04-27 11:04:35,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret6 := main(); {485#true} is VALID [2022-04-27 11:04:35,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {490#(= main_~x~0 0)} is VALID [2022-04-27 11:04:35,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {490#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {490#(= main_~x~0 0)} is VALID [2022-04-27 11:04:35,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {490#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {490#(= main_~x~0 0)} is VALID [2022-04-27 11:04:35,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {490#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:35,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:35,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:35,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {491#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:35,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:35,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {530#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {486#false} is VALID [2022-04-27 11:04:35,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {486#false} is VALID [2022-04-27 11:04:35,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {486#false} is VALID [2022-04-27 11:04:35,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#false} assume !(~x~0 % 4294967296 >= 5000000); {486#false} is VALID [2022-04-27 11:04:35,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {486#false} is VALID [2022-04-27 11:04:35,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {486#false} is VALID [2022-04-27 11:04:35,326 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {486#false} is VALID [2022-04-27 11:04:35,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2022-04-27 11:04:35,326 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2022-04-27 11:04:35,326 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-04-27 11:04:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:04:35,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {486#false} assume 0 == ~cond; {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {486#false} ~cond := #in~cond; {486#false} is VALID [2022-04-27 11:04:35,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {486#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {486#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {486#false} assume !(~x~0 % 4294967296 >= 5000000); {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {486#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {486#false} is VALID [2022-04-27 11:04:35,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {486#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {486#false} is VALID [2022-04-27 11:04:35,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {591#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {486#false} is VALID [2022-04-27 11:04:35,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {595#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {591#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:35,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {595#(or (<= 4294967295 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:04:35,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:35,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:35,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {599#(or (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))) (<= 4294967295 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:35,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:04:35,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:04:35,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {609#(or (<= 4294967295 (mod (+ main_~x~0 2) 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))))} is VALID [2022-04-27 11:04:35,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {485#true} call #t~ret6 := main(); {485#true} is VALID [2022-04-27 11:04:35,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {485#true} {485#true} #42#return; {485#true} is VALID [2022-04-27 11:04:35,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} assume true; {485#true} is VALID [2022-04-27 11:04:35,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {485#true} is VALID [2022-04-27 11:04:35,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {485#true} call ULTIMATE.init(); {485#true} is VALID [2022-04-27 11:04:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:04:35,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521859900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:04:35,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:04:35,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-27 11:04:35,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257089481] [2022-04-27 11:04:35,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:04:35,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:04:35,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:35,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:35,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:04:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:35,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:04:35,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:04:35,539 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:35,785 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-27 11:04:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:04:35,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:04:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 11:04:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-27 11:04:35,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-27 11:04:35,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:35,829 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:04:35,829 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:04:35,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:04:35,830 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:35,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 28 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:04:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:04:35,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-04-27 11:04:35,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:35,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,842 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,842 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:35,844 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 11:04:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:04:35,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:35,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:35,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:04:35,844 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:04:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:35,845 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 11:04:35,845 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-27 11:04:35,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:35,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:35,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:35,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-27 11:04:35,847 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2022-04-27 11:04:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:35,847 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-27 11:04:35,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-27 11:04:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:04:35,847 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:35,848 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:35,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:04:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:04:36,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:36,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1571384604, now seen corresponding path program 2 times [2022-04-27 11:04:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:36,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440249339] [2022-04-27 11:04:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:36,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:36,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {824#true} is VALID [2022-04-27 11:04:36,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} assume true; {824#true} is VALID [2022-04-27 11:04:36,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {824#true} {824#true} #42#return; {824#true} is VALID [2022-04-27 11:04:36,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {824#true} call ULTIMATE.init(); {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:36,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {824#true} is VALID [2022-04-27 11:04:36,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} assume true; {824#true} is VALID [2022-04-27 11:04:36,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} #42#return; {824#true} is VALID [2022-04-27 11:04:36,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {824#true} call #t~ret6 := main(); {824#true} is VALID [2022-04-27 11:04:36,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:04:36,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:04:36,279 INFO L290 TraceCheckUtils]: 7: Hoare triple {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} is VALID [2022-04-27 11:04:36,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {829#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:04:36,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:04:36,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} assume !(~x~0 % 4294967296 >= 5000000); {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:04:36,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {830#(and (<= main_~y~0 (+ 9999999 main_~x~0)) (<= (+ 9999999 main_~x~0) main_~y~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 11:04:36,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 11:04:36,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} assume !(~x~0 % 4294967296 >= 5000000); {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} is VALID [2022-04-27 11:04:36,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (<= (+ main_~x~0 9999998) main_~y~0) (<= main_~y~0 (+ main_~x~0 9999998)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {832#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 11:04:36,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (or (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= main_~y~0 (+ main_~x~0 9999997))) (<= (+ main_~x~0 9999997) main_~y~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 11:04:36,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} assume !(~x~0 % 4294967296 >= 5000000); {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} is VALID [2022-04-27 11:04:36,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {833#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 9999997) main_~y~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {834#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} is VALID [2022-04-27 11:04:36,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {834#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ 9999996 main_~x~0) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {825#false} is VALID [2022-04-27 11:04:36,285 INFO L272 TraceCheckUtils]: 19: Hoare triple {825#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {825#false} is VALID [2022-04-27 11:04:36,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2022-04-27 11:04:36,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {825#false} assume 0 == ~cond; {825#false} is VALID [2022-04-27 11:04:36,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {825#false} assume !false; {825#false} is VALID [2022-04-27 11:04:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:36,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440249339] [2022-04-27 11:04:36,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440249339] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:36,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913501258] [2022-04-27 11:04:36,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:04:36,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:36,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:36,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:36,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:04:36,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 11:04:36,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:04:36,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:04:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:36,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:36,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {824#true} call ULTIMATE.init(); {824#true} is VALID [2022-04-27 11:04:36,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {824#true} is VALID [2022-04-27 11:04:36,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#true} assume true; {824#true} is VALID [2022-04-27 11:04:36,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} #42#return; {824#true} is VALID [2022-04-27 11:04:36,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {824#true} call #t~ret6 := main(); {824#true} is VALID [2022-04-27 11:04:36,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {824#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {854#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {894#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:36,600 INFO L272 TraceCheckUtils]: 19: Hoare triple {894#(and (not (< (mod main_~x~0 4294967296) 10000000)) (= 5000000 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {898#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:36,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {898#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {902#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:36,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {902#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {825#false} is VALID [2022-04-27 11:04:36,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {825#false} assume !false; {825#false} is VALID [2022-04-27 11:04:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-27 11:04:36,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:04:36,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913501258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:04:36,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:04:36,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-04-27 11:04:36,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783107637] [2022-04-27 11:04:36,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:04:36,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:04:36,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:36,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:36,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:04:36,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:04:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:04:36,612 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:36,683 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-27 11:04:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:04:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 11:04:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 11:04:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 11:04:36,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 11:04:36,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:36,701 INFO L225 Difference]: With dead ends: 39 [2022-04-27 11:04:36,701 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:04:36,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:04:36,702 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:36,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:04:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:04:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 11:04:36,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:36,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,727 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,727 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:36,728 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 11:04:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 11:04:36,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:36,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:36,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:04:36,730 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-27 11:04:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:36,732 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 11:04:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 11:04:36,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:36,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:36,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:36,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-04-27 11:04:36,734 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2022-04-27 11:04:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:36,735 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-04-27 11:04:36,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 11:04:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:04:36,738 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:36,738 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:36,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:04:36,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:36,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -366827958, now seen corresponding path program 2 times [2022-04-27 11:04:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:36,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822779151] [2022-04-27 11:04:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:37,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1083#true} is VALID [2022-04-27 11:04:37,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#true} assume true; {1083#true} is VALID [2022-04-27 11:04:37,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1083#true} {1083#true} #42#return; {1083#true} is VALID [2022-04-27 11:04:37,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:37,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {1095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1083#true} is VALID [2022-04-27 11:04:37,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {1083#true} assume true; {1083#true} is VALID [2022-04-27 11:04:37,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} #42#return; {1083#true} is VALID [2022-04-27 11:04:37,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {1083#true} call #t~ret6 := main(); {1083#true} is VALID [2022-04-27 11:04:37,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1088#(= main_~x~0 0)} is VALID [2022-04-27 11:04:37,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1088#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1088#(= main_~x~0 0)} is VALID [2022-04-27 11:04:37,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {1088#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {1088#(= main_~x~0 0)} is VALID [2022-04-27 11:04:37,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {1088#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:37,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:37,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:37,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {1089#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:37,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:37,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:37,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {1090#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:37,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:37,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:37,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:37,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:37,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:37,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:37,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:37,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:37,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {1093#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:37,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:37,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {1094#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1084#false} is VALID [2022-04-27 11:04:37,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {1084#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1084#false} is VALID [2022-04-27 11:04:37,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {1084#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1084#false} is VALID [2022-04-27 11:04:37,087 INFO L272 TraceCheckUtils]: 28: Hoare triple {1084#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1084#false} is VALID [2022-04-27 11:04:37,087 INFO L290 TraceCheckUtils]: 29: Hoare triple {1084#false} ~cond := #in~cond; {1084#false} is VALID [2022-04-27 11:04:37,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {1084#false} assume 0 == ~cond; {1084#false} is VALID [2022-04-27 11:04:37,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2022-04-27 11:04:37,088 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:37,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822779151] [2022-04-27 11:04:37,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822779151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:37,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110126780] [2022-04-27 11:04:37,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:04:37,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:37,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:37,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:37,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:04:37,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:04:37,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:04:37,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:04:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:37,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2022-04-27 11:04:37,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1083#true} is VALID [2022-04-27 11:04:37,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {1083#true} assume true; {1083#true} is VALID [2022-04-27 11:04:37,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} #42#return; {1083#true} is VALID [2022-04-27 11:04:37,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {1083#true} call #t~ret6 := main(); {1083#true} is VALID [2022-04-27 11:04:37,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {1114#(and (= main_~x~0 0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {1124#(and (= (+ (- 1) main_~x~0) 0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 11:04:37,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 11:04:37,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 11:04:37,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(and (= 5000000 main_~z~0) (= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 11:04:37,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 11:04:37,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} assume !(~x~0 % 4294967296 >= 5000000); {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} is VALID [2022-04-27 11:04:37,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {1144#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 11:04:37,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 11:04:37,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 11:04:37,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {1154#(and (= 5000000 main_~z~0) (= main_~x~0 4))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {1164#(and (= (+ (- 1) main_~x~0) 4) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:37,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {1174#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1181#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:04:37,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {1181#(and (= 4 (+ (- 2) main_~x~0)) (= 5000000 (+ (- 1) main_~z~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:04:37,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:04:37,436 INFO L272 TraceCheckUtils]: 28: Hoare triple {1185#(and (= (+ main_~x~0 (- 3)) 4) (= 5000000 (+ (- 1) main_~z~0)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:37,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:37,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1084#false} is VALID [2022-04-27 11:04:37,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2022-04-27 11:04:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:37,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:04:37,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2022-04-27 11:04:37,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1084#false} is VALID [2022-04-27 11:04:37,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1196#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:37,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1192#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:37,719 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:37,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:37,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:37,722 INFO L290 TraceCheckUtils]: 24: Hoare triple {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:37,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1212#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:37,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:37,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:37,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1219#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:37,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:37,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:37,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1238#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:37,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:37,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:37,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1248#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:37,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:04:37,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:04:37,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1258#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:04:37,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:37,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:37,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1268#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:37,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:04:37,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:04:37,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1278#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:04:37,730 INFO L272 TraceCheckUtils]: 4: Hoare triple {1083#true} call #t~ret6 := main(); {1083#true} is VALID [2022-04-27 11:04:37,730 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1083#true} {1083#true} #42#return; {1083#true} is VALID [2022-04-27 11:04:37,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {1083#true} assume true; {1083#true} is VALID [2022-04-27 11:04:37,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1083#true} is VALID [2022-04-27 11:04:37,730 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2022-04-27 11:04:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:04:37,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110126780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:04:37,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:04:37,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 28 [2022-04-27 11:04:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646707191] [2022-04-27 11:04:37,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:04:37,731 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:04:37,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:37,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:37,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:37,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 11:04:37,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 11:04:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-04-27 11:04:37,793 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:42,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:04:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:44,614 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2022-04-27 11:04:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-27 11:04:44,615 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 11:04:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2022-04-27 11:04:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 80 transitions. [2022-04-27 11:04:44,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 80 transitions. [2022-04-27 11:04:46,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:46,811 INFO L225 Difference]: With dead ends: 75 [2022-04-27 11:04:46,811 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 11:04:46,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=355, Invalid=1537, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 11:04:46,812 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:46,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 96 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 467 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-27 11:04:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 11:04:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-04-27 11:04:46,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:46,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:46,829 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:46,829 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:46,831 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-27 11:04:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-27 11:04:46,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:46,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:46,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 11:04:46,832 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 11:04:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:46,833 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-27 11:04:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-04-27 11:04:46,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:46,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:46,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:46,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2022-04-27 11:04:46,835 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 32 [2022-04-27 11:04:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:46,835 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2022-04-27 11:04:46,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 26 states have internal predecessors, (76), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2022-04-27 11:04:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 11:04:46,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:46,836 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:46,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:04:47,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:47,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:47,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1688511374, now seen corresponding path program 3 times [2022-04-27 11:04:47,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:47,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142211478] [2022-04-27 11:04:47,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:47,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:47,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {1665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1652#true} is VALID [2022-04-27 11:04:47,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {1652#true} assume true; {1652#true} is VALID [2022-04-27 11:04:47,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1652#true} {1652#true} #42#return; {1652#true} is VALID [2022-04-27 11:04:47,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1652#true} call ULTIMATE.init(); {1665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:47,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1652#true} is VALID [2022-04-27 11:04:47,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {1652#true} assume true; {1652#true} is VALID [2022-04-27 11:04:47,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1652#true} {1652#true} #42#return; {1652#true} is VALID [2022-04-27 11:04:47,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {1652#true} call #t~ret6 := main(); {1652#true} is VALID [2022-04-27 11:04:47,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1652#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1657#(= main_~x~0 0)} is VALID [2022-04-27 11:04:47,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {1657#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1657#(= main_~x~0 0)} is VALID [2022-04-27 11:04:47,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1657#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {1657#(= main_~x~0 0)} is VALID [2022-04-27 11:04:47,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {1657#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:47,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:47,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {1658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:47,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {1658#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:47,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {1659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:47,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {1659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:47,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {1659#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:47,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:47,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:47,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {1660#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:47,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {1661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:47,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {1661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:47,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {1661#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:47,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {1662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:47,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {1662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:47,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {1662#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:47,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {1663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:47,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {1663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {1663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:47,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {1663#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1664#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 11:04:47,201 INFO L290 TraceCheckUtils]: 27: Hoare triple {1664#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1664#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 28: Hoare triple {1664#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 29: Hoare triple {1653#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 30: Hoare triple {1653#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {1653#false} assume !(~x~0 % 4294967296 >= 5000000); {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {1653#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 33: Hoare triple {1653#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L272 TraceCheckUtils]: 34: Hoare triple {1653#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {1653#false} ~cond := #in~cond; {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {1653#false} assume 0 == ~cond; {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {1653#false} assume !false; {1653#false} is VALID [2022-04-27 11:04:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 38 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:04:47,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:47,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142211478] [2022-04-27 11:04:47,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142211478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:47,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347289323] [2022-04-27 11:04:47,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:04:47,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:47,204 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:47,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:04:47,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-27 11:04:47,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:04:47,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:04:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:47,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:47,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {1652#true} call ULTIMATE.init(); {1652#true} is VALID [2022-04-27 11:04:47,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {1652#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1652#true} is VALID [2022-04-27 11:04:47,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {1652#true} assume true; {1652#true} is VALID [2022-04-27 11:04:47,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1652#true} {1652#true} #42#return; {1652#true} is VALID [2022-04-27 11:04:47,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {1652#true} call #t~ret6 := main(); {1652#true} is VALID [2022-04-27 11:04:47,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {1652#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {1684#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {1684#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {1684#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1684#(= main_~y~0 10000000)} is VALID [2022-04-27 11:04:47,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {1684#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {1763#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:04:47,709 INFO L290 TraceCheckUtils]: 32: Hoare triple {1763#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1767#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:04:47,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1653#false} is VALID [2022-04-27 11:04:47,710 INFO L272 TraceCheckUtils]: 34: Hoare triple {1653#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1653#false} is VALID [2022-04-27 11:04:47,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {1653#false} ~cond := #in~cond; {1653#false} is VALID [2022-04-27 11:04:47,711 INFO L290 TraceCheckUtils]: 36: Hoare triple {1653#false} assume 0 == ~cond; {1653#false} is VALID [2022-04-27 11:04:47,711 INFO L290 TraceCheckUtils]: 37: Hoare triple {1653#false} assume !false; {1653#false} is VALID [2022-04-27 11:04:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 11:04:47,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:04:47,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347289323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:04:47,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:04:47,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-04-27 11:04:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529274819] [2022-04-27 11:04:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:04:47,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 11:04:47,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:47,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:47,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:04:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:04:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:04:47,727 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:47,816 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2022-04-27 11:04:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:04:47,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 11:04:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:04:47,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 11:04:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-27 11:04:47,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-27 11:04:47,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:47,843 INFO L225 Difference]: With dead ends: 72 [2022-04-27 11:04:47,843 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 11:04:47,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:04:47,844 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:04:47,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:04:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 11:04:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2022-04-27 11:04:47,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:04:47,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,867 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,867 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:47,868 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-27 11:04:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-27 11:04:47,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:47,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:47,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 11:04:47,869 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 11:04:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:04:47,871 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2022-04-27 11:04:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-27 11:04:47,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:04:47,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:04:47,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:04:47,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:04:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-04-27 11:04:47,872 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 38 [2022-04-27 11:04:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:04:47,872 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-04-27 11:04:47,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:47,873 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-04-27 11:04:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 11:04:47,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:04:47,875 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:04:47,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 11:04:48,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:48,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:04:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:04:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1453110368, now seen corresponding path program 4 times [2022-04-27 11:04:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:04:48,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555553889] [2022-04-27 11:04:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:04:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:04:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:04:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:48,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {2108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-27 11:04:48,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-27 11:04:48,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2095#true} {2095#true} #42#return; {2095#true} is VALID [2022-04-27 11:04:48,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:04:48,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {2108#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-27 11:04:48,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-27 11:04:48,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #42#return; {2095#true} is VALID [2022-04-27 11:04:48,258 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret6 := main(); {2095#true} is VALID [2022-04-27 11:04:48,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2100#(= main_~x~0 0)} is VALID [2022-04-27 11:04:48,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2100#(= main_~x~0 0)} is VALID [2022-04-27 11:04:48,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {2100#(= main_~x~0 0)} is VALID [2022-04-27 11:04:48,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {2100#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2101#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:48,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {2101#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2101#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:48,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {2101#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {2101#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:04:48,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {2101#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2102#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:48,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {2102#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2102#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:48,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {2102#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2102#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:04:48,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2103#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:48,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {2103#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2103#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:48,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {2103#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2103#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:04:48,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {2103#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2104#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:48,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {2104#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2104#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:48,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {2104#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2104#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:04:48,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {2104#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2105#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:48,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {2105#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2105#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:48,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {2105#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2105#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:04:48,267 INFO L290 TraceCheckUtils]: 23: Hoare triple {2105#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2106#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:48,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {2106#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2106#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:48,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {2106#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {2106#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:04:48,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {2106#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2107#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 11:04:48,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {2107#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2107#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-27 11:04:48,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {2107#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2096#false} is VALID [2022-04-27 11:04:48,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2096#false} is VALID [2022-04-27 11:04:48,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {2096#false} assume !(~x~0 % 4294967296 >= 5000000); {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {2096#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {2096#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {2096#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {2096#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {2096#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L272 TraceCheckUtils]: 37: Hoare triple {2096#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {2096#false} ~cond := #in~cond; {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {2096#false} assume 0 == ~cond; {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-27 11:04:48,269 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 77 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:04:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:04:48,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555553889] [2022-04-27 11:04:48,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555553889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:04:48,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748222525] [2022-04-27 11:04:48,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:04:48,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:04:48,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:04:48,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:04:48,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:04:48,310 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:04:48,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:04:48,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-27 11:04:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:04:48,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:04:48,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-27 11:04:48,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-27 11:04:48,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-27 11:04:48,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #42#return; {2095#true} is VALID [2022-04-27 11:04:48,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret6 := main(); {2095#true} is VALID [2022-04-27 11:04:48,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2127#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2127#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2127#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {2127#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {2127#(and (= main_~x~0 0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2137#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {2137#(and (= main_~x~0 1) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2137#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (= main_~x~0 1) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {2137#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {2137#(and (= main_~x~0 1) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2147#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {2147#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2147#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {2147#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {2147#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {2147#(and (= (+ (- 1) main_~x~0) 1) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2157#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {2157#(and (= main_~x~0 3) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2157#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {2157#(and (= main_~x~0 3) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {2157#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {2157#(and (= main_~x~0 3) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2167#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {2167#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2167#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {2167#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {2167#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {2167#(and (= (+ (- 1) main_~x~0) 3) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2177#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 11:04:48,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {2177#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2177#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 11:04:48,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {2177#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2177#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 11:04:48,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {2177#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2187#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {2187#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2187#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {2187#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {2187#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:04:48,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {2187#(and (= (+ (- 1) main_~x~0) 5) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2197#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:04:48,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2197#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:04:48,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {2197#(and (= 5000000 main_~z~0) (= 5 (+ (- 2) main_~x~0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2204#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:04:48,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {2204#(and (= main_~z~0 5000001) (= 5 (+ (- 2) main_~x~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2208#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 11:04:48,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {2208#(and (= main_~z~0 5000001) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2208#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 11:04:48,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {2208#(and (= main_~z~0 5000001) (= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {2208#(and (= main_~z~0 5000001) (= main_~x~0 8))} is VALID [2022-04-27 11:04:48,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {2208#(and (= main_~z~0 5000001) (= main_~x~0 8))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2218#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-27 11:04:48,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {2218#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2218#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} is VALID [2022-04-27 11:04:48,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {2218#(and (= (+ (- 1) main_~x~0) 8) (= main_~z~0 5000001))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2225#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:04:48,690 INFO L290 TraceCheckUtils]: 35: Hoare triple {2225#(and (= (+ (- 1) main_~x~0) 8) (= 5000001 (+ (- 1) main_~z~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2229#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:04:48,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {2229#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2229#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:04:48,691 INFO L272 TraceCheckUtils]: 37: Hoare triple {2229#(and (= main_~x~0 10) (= 5000001 (+ (- 1) main_~z~0)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2236#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:48,691 INFO L290 TraceCheckUtils]: 38: Hoare triple {2236#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2240#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:48,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {2240#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-27 11:04:48,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-27 11:04:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:04:48,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:04:49,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {2096#false} assume !false; {2096#false} is VALID [2022-04-27 11:04:49,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {2240#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2096#false} is VALID [2022-04-27 11:04:49,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {2236#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2240#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:04:49,127 INFO L272 TraceCheckUtils]: 37: Hoare triple {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2236#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:04:49,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:49,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:49,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:49,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:49,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2256#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:04:49,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:49,140 INFO L290 TraceCheckUtils]: 30: Hoare triple {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:49,140 INFO L290 TraceCheckUtils]: 29: Hoare triple {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:49,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:49,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2263#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:04:49,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {2301#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2282#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {2301#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2301#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {2301#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2301#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {2311#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2301#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:04:49,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {2311#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2311#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:04:49,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {2311#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2311#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:04:49,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2311#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:04:49,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2321#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:49,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2321#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:49,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {2331#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2321#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:49,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {2331#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2331#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:04:49,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {2331#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2331#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:04:49,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {2341#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2331#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:04:49,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {2341#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2341#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:49,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {2341#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2341#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:49,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2341#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:04:49,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2351#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:04:49,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2351#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:04:49,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2095#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2351#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:04:49,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2095#true} call #t~ret6 := main(); {2095#true} is VALID [2022-04-27 11:04:49,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2095#true} {2095#true} #42#return; {2095#true} is VALID [2022-04-27 11:04:49,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {2095#true} assume true; {2095#true} is VALID [2022-04-27 11:04:49,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {2095#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2095#true} is VALID [2022-04-27 11:04:49,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {2095#true} call ULTIMATE.init(); {2095#true} is VALID [2022-04-27 11:04:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-27 11:04:49,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748222525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:04:49,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:04:49,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 35 [2022-04-27 11:04:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360914250] [2022-04-27 11:04:49,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:04:49,162 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:04:49,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:04:49,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:49,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:04:49,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-27 11:04:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:04:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-27 11:04:49,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=983, Unknown=0, NotChecked=0, Total=1190 [2022-04-27 11:04:49,223 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:04:58,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:00,812 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:03,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:05,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:07,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:09,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:10,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:05:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:19,033 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2022-04-27 11:05:19,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-27 11:05:19,033 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 11:05:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:05:19,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 93 transitions. [2022-04-27 11:05:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 93 transitions. [2022-04-27 11:05:19,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 93 transitions. [2022-04-27 11:05:29,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 89 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:05:29,324 INFO L225 Difference]: With dead ends: 91 [2022-04-27 11:05:29,324 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 11:05:29,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=557, Invalid=2523, Unknown=0, NotChecked=0, Total=3080 [2022-04-27 11:05:29,326 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 41 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:05:29,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 107 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 619 Invalid, 5 Unknown, 0 Unchecked, 14.5s Time] [2022-04-27 11:05:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 11:05:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2022-04-27 11:05:29,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:05:29,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:29,351 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:29,351 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:29,352 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-27 11:05:29,352 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-04-27 11:05:29,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:05:29,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:05:29,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 11:05:29,353 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 11:05:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:29,354 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-04-27 11:05:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-04-27 11:05:29,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:05:29,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:05:29,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:05:29,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:05:29,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:29,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-04-27 11:05:29,355 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 41 [2022-04-27 11:05:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:05:29,356 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-04-27 11:05:29,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.8) internal successors, (98), 33 states have internal predecessors, (98), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-04-27 11:05:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 11:05:29,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:05:29,370 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:05:29,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:05:29,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:05:29,571 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:05:29,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:05:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2019771228, now seen corresponding path program 5 times [2022-04-27 11:05:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:05:29,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796346456] [2022-04-27 11:05:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:05:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:05:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:05:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:29,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {2800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2786#true} is VALID [2022-04-27 11:05:29,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {2786#true} assume true; {2786#true} is VALID [2022-04-27 11:05:29,748 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2786#true} {2786#true} #42#return; {2786#true} is VALID [2022-04-27 11:05:29,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {2786#true} call ULTIMATE.init(); {2800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:05:29,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {2800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2786#true} is VALID [2022-04-27 11:05:29,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {2786#true} assume true; {2786#true} is VALID [2022-04-27 11:05:29,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2786#true} {2786#true} #42#return; {2786#true} is VALID [2022-04-27 11:05:29,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {2786#true} call #t~ret6 := main(); {2786#true} is VALID [2022-04-27 11:05:29,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {2786#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2791#(= main_~x~0 0)} is VALID [2022-04-27 11:05:29,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {2791#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2791#(= main_~x~0 0)} is VALID [2022-04-27 11:05:29,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {2791#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {2791#(= main_~x~0 0)} is VALID [2022-04-27 11:05:29,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {2791#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2792#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:29,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2792#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:29,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {2792#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {2792#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:29,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2793#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:29,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {2793#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2793#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:29,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2793#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:29,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {2793#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2794#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:29,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {2794#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2794#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:29,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {2794#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2794#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:29,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {2794#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2795#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:29,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {2795#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2795#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:29,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {2795#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2795#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:29,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {2795#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2796#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:29,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {2796#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2796#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:29,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {2796#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2796#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:29,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {2796#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2797#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:29,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {2797#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2797#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:29,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {2797#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {2797#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:29,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {2797#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2798#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:29,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {2798#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2798#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:29,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {2798#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2798#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:29,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {2798#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2799#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {2799#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2799#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {2799#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {2787#false} assume !(~x~0 % 4294967296 >= 5000000); {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {2787#false} assume !(~x~0 % 4294967296 >= 5000000); {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:29,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L290 TraceCheckUtils]: 40: Hoare triple {2787#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L290 TraceCheckUtils]: 41: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {2787#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L272 TraceCheckUtils]: 43: Hoare triple {2787#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {2787#false} ~cond := #in~cond; {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L290 TraceCheckUtils]: 45: Hoare triple {2787#false} assume 0 == ~cond; {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L290 TraceCheckUtils]: 46: Hoare triple {2787#false} assume !false; {2787#false} is VALID [2022-04-27 11:05:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 95 proven. 100 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:05:29,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:05:29,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796346456] [2022-04-27 11:05:29,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796346456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:05:29,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214114953] [2022-04-27 11:05:29,763 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:05:29,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:05:29,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:05:29,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:05:29,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 11:05:29,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-04-27 11:05:29,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:05:29,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:05:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:29,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:05:30,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {2786#true} call ULTIMATE.init(); {2786#true} is VALID [2022-04-27 11:05:30,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {2786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2786#true} is VALID [2022-04-27 11:05:30,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {2786#true} assume true; {2786#true} is VALID [2022-04-27 11:05:30,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2786#true} {2786#true} #42#return; {2786#true} is VALID [2022-04-27 11:05:30,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {2786#true} call #t~ret6 := main(); {2786#true} is VALID [2022-04-27 11:05:30,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {2786#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2786#true} is VALID [2022-04-27 11:05:30,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2888#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:05:30,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {2888#(not (<= 5000000 (mod main_~x~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2892#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:05:30,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {2892#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2892#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:05:30,347 INFO L290 TraceCheckUtils]: 31: Hoare triple {2892#(not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2899#(and (<= 5000000 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:05:30,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {2899#(and (<= 5000000 (mod main_~x~0 4294967296)) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2903#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:05:30,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2903#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#(and (not (<= 5000000 (mod (+ main_~x~0 4294967294) 4294967296))) (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {2787#false} assume !(~x~0 % 4294967296 >= 5000000); {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {2787#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {2787#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L272 TraceCheckUtils]: 43: Hoare triple {2787#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 44: Hoare triple {2787#false} ~cond := #in~cond; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 45: Hoare triple {2787#false} assume 0 == ~cond; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L290 TraceCheckUtils]: 46: Hoare triple {2787#false} assume !false; {2787#false} is VALID [2022-04-27 11:05:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 123 proven. 3 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 11:05:30,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:05:30,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {2787#false} assume !false; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 45: Hoare triple {2787#false} assume 0 == ~cond; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 44: Hoare triple {2787#false} ~cond := #in~cond; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L272 TraceCheckUtils]: 43: Hoare triple {2787#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {2787#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {2787#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {2787#false} assume !(~x~0 % 4294967296 >= 5000000); {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {2787#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {2787#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2787#false} is VALID [2022-04-27 11:05:30,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {2982#(<= 5000000 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {2787#false} is VALID [2022-04-27 11:05:30,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {2982#(<= 5000000 (mod main_~x~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2982#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:05:30,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {2989#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2982#(<= 5000000 (mod main_~x~0 4294967296))} is VALID [2022-04-27 11:05:30,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {2993#(or (not (<= 5000000 (mod main_~x~0 4294967296))) (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {2989#(<= 5000000 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-27 11:05:30,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2993#(or (not (<= 5000000 (mod main_~x~0 4294967296))) (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:05:30,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {2786#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {2786#true} assume !(~x~0 % 4294967296 >= 5000000); {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {2786#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {2786#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {2786#true} call #t~ret6 := main(); {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2786#true} {2786#true} #42#return; {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {2786#true} assume true; {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {2786#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {2786#true} call ULTIMATE.init(); {2786#true} is VALID [2022-04-27 11:05:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 110 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-04-27 11:05:30,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214114953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:05:30,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:05:30,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 5] total 19 [2022-04-27 11:05:30,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876483097] [2022-04-27 11:05:30,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:05:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-27 11:05:30,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:05:30,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:30,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:05:30,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 11:05:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:05:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 11:05:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:05:30,622 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:31,552 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-27 11:05:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:05:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-27 11:05:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:05:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2022-04-27 11:05:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2022-04-27 11:05:31,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2022-04-27 11:05:31,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:05:31,636 INFO L225 Difference]: With dead ends: 106 [2022-04-27 11:05:31,636 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 11:05:31,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2022-04-27 11:05:31,639 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:05:31,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 57 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:05:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 11:05:31,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-27 11:05:31,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:05:31,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,676 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,676 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:31,678 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 11:05:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 11:05:31,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:05:31,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:05:31,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 11:05:31,679 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 11:05:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:31,680 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 11:05:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 11:05:31,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:05:31,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:05:31,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:05:31,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:05:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-27 11:05:31,681 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 47 [2022-04-27 11:05:31,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:05:31,681 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-27 11:05:31,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:31,681 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-27 11:05:31,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 11:05:31,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:05:31,682 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:05:31,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:05:31,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:05:31,898 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:05:31,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:05:31,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1619387038, now seen corresponding path program 6 times [2022-04-27 11:05:31,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:05:31,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870750088] [2022-04-27 11:05:31,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:05:31,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:05:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:05:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:32,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {3532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3509#true} is VALID [2022-04-27 11:05:32,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {3509#true} assume true; {3509#true} is VALID [2022-04-27 11:05:32,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3509#true} {3509#true} #42#return; {3509#true} is VALID [2022-04-27 11:05:32,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {3509#true} call ULTIMATE.init(); {3532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:05:32,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {3532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3509#true} is VALID [2022-04-27 11:05:32,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {3509#true} assume true; {3509#true} is VALID [2022-04-27 11:05:32,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3509#true} {3509#true} #42#return; {3509#true} is VALID [2022-04-27 11:05:32,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {3509#true} call #t~ret6 := main(); {3509#true} is VALID [2022-04-27 11:05:32,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {3509#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3514#(= main_~x~0 0)} is VALID [2022-04-27 11:05:32,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {3514#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3514#(= main_~x~0 0)} is VALID [2022-04-27 11:05:32,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {3514#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {3514#(= main_~x~0 0)} is VALID [2022-04-27 11:05:32,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {3514#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3515#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:32,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {3515#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3515#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:32,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {3515#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {3515#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:32,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {3515#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3516#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:32,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {3516#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3516#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:32,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {3516#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {3516#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:32,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {3516#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:32,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {3517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:32,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {3517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:32,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {3517#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3518#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:32,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {3518#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3518#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:32,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {3518#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3518#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:32,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {3518#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3519#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:32,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {3519#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3519#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:32,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {3519#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {3519#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:32,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {3519#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3520#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:32,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {3520#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3520#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:32,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {3520#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:32,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3521#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:32,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {3521#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3521#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:32,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {3521#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3521#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:32,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {3521#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3522#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:32,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {3522#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3522#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:32,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {3522#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3522#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:32,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {3522#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3523#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:32,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {3523#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3523#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:32,177 INFO L290 TraceCheckUtils]: 34: Hoare triple {3523#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3523#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:32,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {3523#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3524#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:32,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {3524#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3524#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:32,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {3524#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3524#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:32,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {3524#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3525#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:32,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {3525#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3525#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:32,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {3525#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3525#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:32,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {3525#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3526#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:32,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {3526#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3526#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:32,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {3526#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3526#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:32,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {3526#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3527#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:32,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3527#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:32,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {3527#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3527#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:32,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {3527#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3528#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:32,180 INFO L290 TraceCheckUtils]: 48: Hoare triple {3528#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3528#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:32,181 INFO L290 TraceCheckUtils]: 49: Hoare triple {3528#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {3528#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:32,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {3528#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3529#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:32,181 INFO L290 TraceCheckUtils]: 51: Hoare triple {3529#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3529#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:32,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {3529#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {3529#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:32,182 INFO L290 TraceCheckUtils]: 53: Hoare triple {3529#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3530#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:32,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {3530#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3530#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:32,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {3530#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {3530#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:32,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {3530#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {3531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {3531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3510#false} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 59: Hoare triple {3510#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3510#false} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {3510#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3510#false} is VALID [2022-04-27 11:05:32,183 INFO L272 TraceCheckUtils]: 61: Hoare triple {3510#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3510#false} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {3510#false} ~cond := #in~cond; {3510#false} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 63: Hoare triple {3510#false} assume 0 == ~cond; {3510#false} is VALID [2022-04-27 11:05:32,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {3510#false} assume !false; {3510#false} is VALID [2022-04-27 11:05:32,184 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 35 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:05:32,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:05:32,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870750088] [2022-04-27 11:05:32,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870750088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:05:32,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811514184] [2022-04-27 11:05:32,184 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:05:32,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:05:32,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:05:32,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:05:32,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 11:05:32,221 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:05:32,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:05:32,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:05:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:32,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:05:32,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {3509#true} call ULTIMATE.init(); {3509#true} is VALID [2022-04-27 11:05:32,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {3509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3509#true} is VALID [2022-04-27 11:05:32,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {3509#true} assume true; {3509#true} is VALID [2022-04-27 11:05:32,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3509#true} {3509#true} #42#return; {3509#true} is VALID [2022-04-27 11:05:32,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {3509#true} call #t~ret6 := main(); {3509#true} is VALID [2022-04-27 11:05:32,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {3509#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,659 INFO L290 TraceCheckUtils]: 33: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,661 INFO L290 TraceCheckUtils]: 39: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,662 INFO L290 TraceCheckUtils]: 40: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,662 INFO L290 TraceCheckUtils]: 42: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,667 INFO L290 TraceCheckUtils]: 55: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,667 INFO L290 TraceCheckUtils]: 56: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:05:32,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {3551#(and (= main_~y~0 10000000) (= 5000000 main_~z~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3711#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:05:32,668 INFO L290 TraceCheckUtils]: 59: Hoare triple {3711#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3711#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:05:32,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {3711#(and (= main_~y~0 10000000) (= 5000000 (+ (- 1) main_~z~0)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3718#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} is VALID [2022-04-27 11:05:32,669 INFO L272 TraceCheckUtils]: 61: Hoare triple {3718#(and (= 5000000 (+ (- 1) main_~z~0)) (not (< (mod main_~x~0 4294967296) 10000000)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:05:32,669 INFO L290 TraceCheckUtils]: 62: Hoare triple {3722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:05:32,669 INFO L290 TraceCheckUtils]: 63: Hoare triple {3726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3510#false} is VALID [2022-04-27 11:05:32,670 INFO L290 TraceCheckUtils]: 64: Hoare triple {3510#false} assume !false; {3510#false} is VALID [2022-04-27 11:05:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-27 11:05:32,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:05:33,068 INFO L290 TraceCheckUtils]: 64: Hoare triple {3510#false} assume !false; {3510#false} is VALID [2022-04-27 11:05:33,068 INFO L290 TraceCheckUtils]: 63: Hoare triple {3726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3510#false} is VALID [2022-04-27 11:05:33,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {3722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:05:33,069 INFO L272 TraceCheckUtils]: 61: Hoare triple {3742#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:05:33,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {3746#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3742#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:05:33,070 INFO L290 TraceCheckUtils]: 59: Hoare triple {3746#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3746#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,073 INFO L290 TraceCheckUtils]: 58: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {3746#(< (mod main_~z~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,073 INFO L290 TraceCheckUtils]: 57: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,073 INFO L290 TraceCheckUtils]: 56: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,073 INFO L290 TraceCheckUtils]: 55: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,074 INFO L290 TraceCheckUtils]: 50: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,076 INFO L290 TraceCheckUtils]: 44: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,078 INFO L290 TraceCheckUtils]: 35: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 >= 5000000); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {3509#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3753#(< (mod (+ main_~z~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:05:33,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {3509#true} call #t~ret6 := main(); {3509#true} is VALID [2022-04-27 11:05:33,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3509#true} {3509#true} #42#return; {3509#true} is VALID [2022-04-27 11:05:33,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {3509#true} assume true; {3509#true} is VALID [2022-04-27 11:05:33,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {3509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3509#true} is VALID [2022-04-27 11:05:33,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {3509#true} call ULTIMATE.init(); {3509#true} is VALID [2022-04-27 11:05:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2022-04-27 11:05:33,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811514184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:05:33,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:05:33,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 29 [2022-04-27 11:05:33,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658128233] [2022-04-27 11:05:33,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:05:33,090 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 11:05:33,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:05:33,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:33,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:05:33,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 11:05:33,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:05:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 11:05:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:05:33,153 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:35,362 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-04-27 11:05:35,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 11:05:35,362 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-27 11:05:35,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:05:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2022-04-27 11:05:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2022-04-27 11:05:35,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 101 transitions. [2022-04-27 11:05:35,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:05:35,448 INFO L225 Difference]: With dead ends: 95 [2022-04-27 11:05:35,448 INFO L226 Difference]: Without dead ends: 82 [2022-04-27 11:05:35,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=439, Invalid=2753, Unknown=0, NotChecked=0, Total=3192 [2022-04-27 11:05:35,450 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 163 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:05:35,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 52 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:05:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-27 11:05:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2022-04-27 11:05:35,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:05:35,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,494 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,494 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:35,496 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-27 11:05:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-27 11:05:35,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:05:35,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:05:35,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-27 11:05:35,496 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-27 11:05:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:05:35,498 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2022-04-27 11:05:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-27 11:05:35,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:05:35,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:05:35,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:05:35,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:05:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0273972602739727) internal successors, (75), 73 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-04-27 11:05:35,499 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 65 [2022-04-27 11:05:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:05:35,499 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-04-27 11:05:35,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.888888888888889) internal successors, (78), 27 states have internal predecessors, (78), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-04-27 11:05:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-27 11:05:35,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:05:35,500 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 18, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:05:35,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 11:05:35,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 11:05:35,716 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:05:35,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:05:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1533648996, now seen corresponding path program 7 times [2022-04-27 11:05:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:05:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847188327] [2022-04-27 11:05:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:05:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:05:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:36,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:05:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:36,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {4413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:05:36,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:05:36,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4389#true} {4389#true} #42#return; {4389#true} is VALID [2022-04-27 11:05:36,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:05:36,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {4413#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:05:36,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:05:36,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #42#return; {4389#true} is VALID [2022-04-27 11:05:36,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret6 := main(); {4389#true} is VALID [2022-04-27 11:05:36,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {4389#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4394#(= main_~x~0 0)} is VALID [2022-04-27 11:05:36,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {4394#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4394#(= main_~x~0 0)} is VALID [2022-04-27 11:05:36,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {4394#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {4394#(= main_~x~0 0)} is VALID [2022-04-27 11:05:36,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {4394#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:36,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:36,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:36,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:36,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:36,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:36,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:36,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:36,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:36,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:36,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:36,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:36,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:36,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:36,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:36,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:36,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:36,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:36,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:36,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:36,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:36,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:36,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:36,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:36,080 INFO L290 TraceCheckUtils]: 32: Hoare triple {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:36,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:36,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:36,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:36,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:36,082 INFO L290 TraceCheckUtils]: 37: Hoare triple {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:36,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:36,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:36,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:36,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:36,083 INFO L290 TraceCheckUtils]: 42: Hoare triple {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:36,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:36,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:36,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:36,085 INFO L290 TraceCheckUtils]: 46: Hoare triple {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:36,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:36,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:36,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:36,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:36,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:36,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:36,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:36,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:36,088 INFO L290 TraceCheckUtils]: 55: Hoare triple {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:36,088 INFO L290 TraceCheckUtils]: 56: Hoare triple {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:36,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:36,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 >= 5000000); {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:36,089 INFO L290 TraceCheckUtils]: 59: Hoare triple {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4412#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:05:36,090 INFO L290 TraceCheckUtils]: 60: Hoare triple {4412#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4412#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:05:36,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {4412#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,090 INFO L290 TraceCheckUtils]: 62: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,090 INFO L290 TraceCheckUtils]: 64: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 66: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 67: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 71: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 72: Hoare triple {4390#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L272 TraceCheckUtils]: 73: Hoare triple {4390#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {4390#false} ~cond := #in~cond; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 75: Hoare triple {4390#false} assume 0 == ~cond; {4390#false} is VALID [2022-04-27 11:05:36,091 INFO L290 TraceCheckUtils]: 76: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-27 11:05:36,092 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 205 proven. 495 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:05:36,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:05:36,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847188327] [2022-04-27 11:05:36,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847188327] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:05:36,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299509452] [2022-04-27 11:05:36,092 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:05:36,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:05:36,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:05:36,093 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:05:36,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 11:05:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:36,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-27 11:05:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:05:36,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:05:36,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4389#true} is VALID [2022-04-27 11:05:36,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:05:36,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:05:36,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #42#return; {4389#true} is VALID [2022-04-27 11:05:36,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret6 := main(); {4389#true} is VALID [2022-04-27 11:05:36,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {4389#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4394#(= main_~x~0 0)} is VALID [2022-04-27 11:05:36,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {4394#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4394#(= main_~x~0 0)} is VALID [2022-04-27 11:05:36,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {4394#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {4394#(= main_~x~0 0)} is VALID [2022-04-27 11:05:36,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {4394#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:36,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:36,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:05:36,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {4395#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:36,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:36,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:05:36,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {4396#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:36,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:36,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:05:36,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {4397#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:36,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:36,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:05:36,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {4398#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:36,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:36,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:05:36,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {4399#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:36,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:36,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:05:36,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {4400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:36,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:36,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:05:36,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {4401#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:36,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:36,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:05:36,764 INFO L290 TraceCheckUtils]: 32: Hoare triple {4402#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:36,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:36,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:05:36,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {4403#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:36,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:36,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:05:36,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {4404#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:36,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:36,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:05:36,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {4405#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:36,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:36,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:05:36,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {4406#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:36,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:36,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:05:36,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {4407#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:36,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:36,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:05:36,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {4408#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:36,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:36,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:05:36,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {4409#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:36,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:36,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:05:36,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {4410#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:36,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:36,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 >= 5000000); {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:05:36,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {4411#(and (<= 17 main_~x~0) (<= main_~x~0 17))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:05:36,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {4594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:05:36,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {4594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:05:36,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {4594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4604#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:05:36,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {4604#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4604#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:05:36,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {4604#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 67: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 68: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 69: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 70: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 71: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 72: Hoare triple {4390#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L272 TraceCheckUtils]: 73: Hoare triple {4390#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 74: Hoare triple {4390#false} ~cond := #in~cond; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 75: Hoare triple {4390#false} assume 0 == ~cond; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L290 TraceCheckUtils]: 76: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-27 11:05:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:05:36,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:05:37,438 INFO L290 TraceCheckUtils]: 76: Hoare triple {4390#false} assume !false; {4390#false} is VALID [2022-04-27 11:05:37,438 INFO L290 TraceCheckUtils]: 75: Hoare triple {4390#false} assume 0 == ~cond; {4390#false} is VALID [2022-04-27 11:05:37,438 INFO L290 TraceCheckUtils]: 74: Hoare triple {4390#false} ~cond := #in~cond; {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L272 TraceCheckUtils]: 73: Hoare triple {4390#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 72: Hoare triple {4390#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 71: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 70: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 69: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 68: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {4390#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {4390#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4390#false} is VALID [2022-04-27 11:05:37,439 INFO L290 TraceCheckUtils]: 65: Hoare triple {4390#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4390#false} is VALID [2022-04-27 11:05:37,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {4683#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4390#false} is VALID [2022-04-27 11:05:37,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {4683#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4683#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:05:37,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {4690#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4683#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:05:37,441 INFO L290 TraceCheckUtils]: 61: Hoare triple {4690#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {4690#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:05:37,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {4690#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4690#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:05:37,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {4700#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4690#(not (<= 5000000 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:05:37,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {4700#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4700#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:05:37,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {4700#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4700#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:05:37,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {4710#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4700#(not (<= 5000000 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 11:05:37,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {4710#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4710#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:05:37,443 INFO L290 TraceCheckUtils]: 54: Hoare triple {4710#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4710#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:05:37,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {4720#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4710#(not (<= 5000000 (mod (+ main_~x~0 3) 4294967296)))} is VALID [2022-04-27 11:05:37,444 INFO L290 TraceCheckUtils]: 52: Hoare triple {4720#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4720#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:05:37,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {4720#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4720#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:05:37,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {4730#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4720#(not (<= 5000000 (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:05:37,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {4730#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4730#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {4730#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4730#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,446 INFO L290 TraceCheckUtils]: 47: Hoare triple {4740#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4730#(not (<= 5000000 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {4740#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4740#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:05:37,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {4740#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4740#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:05:37,447 INFO L290 TraceCheckUtils]: 44: Hoare triple {4750#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4740#(not (<= 5000000 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:05:37,447 INFO L290 TraceCheckUtils]: 43: Hoare triple {4750#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4750#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,447 INFO L290 TraceCheckUtils]: 42: Hoare triple {4750#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4750#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {4760#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4750#(not (<= 5000000 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {4760#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4760#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:05:37,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {4760#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4760#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:05:37,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {4770#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4760#(not (<= 5000000 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:05:37,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {4770#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4770#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:05:37,449 INFO L290 TraceCheckUtils]: 36: Hoare triple {4770#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4770#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:05:37,449 INFO L290 TraceCheckUtils]: 35: Hoare triple {4780#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4770#(not (<= 5000000 (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:05:37,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {4780#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4780#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 11:05:37,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {4780#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4780#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 11:05:37,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {4790#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4780#(not (<= 5000000 (mod (+ main_~x~0 10) 4294967296)))} is VALID [2022-04-27 11:05:37,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {4790#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4790#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 11:05:37,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {4790#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4790#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 11:05:37,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {4800#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4790#(not (<= 5000000 (mod (+ main_~x~0 11) 4294967296)))} is VALID [2022-04-27 11:05:37,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {4800#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4800#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:05:37,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {4800#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4800#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:05:37,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {4810#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4800#(not (<= 5000000 (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:05:37,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {4810#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4810#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 11:05:37,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {4810#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 11:05:37,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {4820#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#(not (<= 5000000 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 11:05:37,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {4820#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4820#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 11:05:37,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {4820#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4820#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 11:05:37,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {4830#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4820#(not (<= 5000000 (mod (+ main_~x~0 14) 4294967296)))} is VALID [2022-04-27 11:05:37,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {4830#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4830#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 11:05:37,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {4830#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4830#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 11:05:37,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {4840#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4830#(not (<= 5000000 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 11:05:37,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {4840#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4840#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 11:05:37,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {4840#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4840#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 11:05:37,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {4850#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4840#(not (<= 5000000 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-27 11:05:37,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {4850#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4850#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:05:37,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {4850#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4850#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:05:37,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {4860#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4850#(not (<= 5000000 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:05:37,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {4860#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4860#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 11:05:37,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {4860#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4860#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 11:05:37,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {4870#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4860#(not (<= 5000000 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 11:05:37,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {4870#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {4870#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {4870#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4870#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {4389#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4870#(not (<= 5000000 (mod (+ 19 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:05:37,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {4389#true} call #t~ret6 := main(); {4389#true} is VALID [2022-04-27 11:05:37,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4389#true} {4389#true} #42#return; {4389#true} is VALID [2022-04-27 11:05:37,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {4389#true} assume true; {4389#true} is VALID [2022-04-27 11:05:37,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {4389#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4389#true} is VALID [2022-04-27 11:05:37,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {4389#true} call ULTIMATE.init(); {4389#true} is VALID [2022-04-27 11:05:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 157 proven. 551 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:05:37,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299509452] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:05:37,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:05:37,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2022-04-27 11:05:37,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991477882] [2022-04-27 11:05:37,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:05:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 11:05:37,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:05:37,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:05:37,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:05:37,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-27 11:05:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:05:37,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-27 11:05:37,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2022-04-27 11:05:37,524 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:06:39,720 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2022-04-27 11:06:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-27 11:06:39,720 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-27 11:06:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:06:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 165 transitions. [2022-04-27 11:06:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 165 transitions. [2022-04-27 11:06:39,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 165 transitions. [2022-04-27 11:06:40,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:06:40,049 INFO L225 Difference]: With dead ends: 160 [2022-04-27 11:06:40,049 INFO L226 Difference]: Without dead ends: 144 [2022-04-27 11:06:40,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=1881, Invalid=5089, Unknown=2, NotChecked=0, Total=6972 [2022-04-27 11:06:40,051 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 168 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:06:40,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 119 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 11:06:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-27 11:06:40,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-27 11:06:40,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:06:40,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:40,130 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:40,130 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:06:40,131 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 11:06:40,131 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 11:06:40,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:06:40,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:06:40,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 11:06:40,132 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 144 states. [2022-04-27 11:06:40,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:06:40,138 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-04-27 11:06:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 11:06:40,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:06:40,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:06:40,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:06:40,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:06:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.014388489208633) internal successors, (141), 139 states have internal predecessors, (141), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-04-27 11:06:40,141 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 77 [2022-04-27 11:06:40,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:06:40,141 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-04-27 11:06:40,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.022727272727273) internal successors, (133), 43 states have internal predecessors, (133), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:40,141 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-04-27 11:06:40,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-27 11:06:40,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:06:40,142 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 40, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:06:40,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 11:06:40,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:06:40,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:06:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:06:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1670724964, now seen corresponding path program 8 times [2022-04-27 11:06:40,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:06:40,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345787073] [2022-04-27 11:06:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:06:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:06:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:06:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:41,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {5723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5677#true} is VALID [2022-04-27 11:06:41,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {5677#true} assume true; {5677#true} is VALID [2022-04-27 11:06:41,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5677#true} {5677#true} #42#return; {5677#true} is VALID [2022-04-27 11:06:41,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {5677#true} call ULTIMATE.init(); {5723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:06:41,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {5723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5677#true} is VALID [2022-04-27 11:06:41,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {5677#true} assume true; {5677#true} is VALID [2022-04-27 11:06:41,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5677#true} {5677#true} #42#return; {5677#true} is VALID [2022-04-27 11:06:41,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {5677#true} call #t~ret6 := main(); {5677#true} is VALID [2022-04-27 11:06:41,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {5677#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5682#(= main_~x~0 0)} is VALID [2022-04-27 11:06:41,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {5682#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5682#(= main_~x~0 0)} is VALID [2022-04-27 11:06:41,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {5682#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {5682#(= main_~x~0 0)} is VALID [2022-04-27 11:06:41,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {5682#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5683#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:06:41,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {5683#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5683#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:06:41,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {5683#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {5683#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:06:41,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {5683#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:06:41,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {5684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:06:41,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {5684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {5684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:06:41,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {5684#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5685#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:06:41,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {5685#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5685#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:06:41,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {5685#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5685#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:06:41,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {5685#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5686#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:06:41,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {5686#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5686#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:06:41,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {5686#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5686#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:06:41,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {5686#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5687#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:06:41,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {5687#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5687#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:06:41,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {5687#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {5687#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:06:41,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {5687#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5688#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:06:41,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {5688#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5688#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:06:41,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {5688#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {5688#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:06:41,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {5688#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5689#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:06:41,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {5689#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5689#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:06:41,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {5689#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5689#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:06:41,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {5689#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:06:41,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {5690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:06:41,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {5690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:06:41,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5691#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:06:41,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {5691#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5691#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:06:41,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {5691#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5691#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:06:41,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {5691#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:06:41,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {5692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:06:41,396 INFO L290 TraceCheckUtils]: 37: Hoare triple {5692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 11:06:41,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {5692#(and (<= main_~x~0 10) (<= 10 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5693#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:06:41,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {5693#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5693#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:06:41,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {5693#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5693#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 11:06:41,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {5693#(and (<= main_~x~0 11) (<= 11 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5694#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:06:41,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {5694#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5694#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:06:41,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {5694#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5694#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 11:06:41,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {5694#(and (<= main_~x~0 12) (<= 12 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5695#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:06:41,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {5695#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5695#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:06:41,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {5695#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5695#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 11:06:41,399 INFO L290 TraceCheckUtils]: 47: Hoare triple {5695#(and (<= main_~x~0 13) (<= 13 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5696#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:06:41,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {5696#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5696#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:06:41,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {5696#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 >= 5000000); {5696#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 11:06:41,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {5696#(and (<= 14 main_~x~0) (<= main_~x~0 14))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5697#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:06:41,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {5697#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5697#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:06:41,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {5697#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 >= 5000000); {5697#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 11:06:41,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {5697#(and (<= 15 main_~x~0) (<= main_~x~0 15))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5698#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:06:41,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {5698#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5698#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:06:41,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {5698#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5698#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 11:06:41,402 INFO L290 TraceCheckUtils]: 56: Hoare triple {5698#(and (<= main_~x~0 16) (<= 16 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5699#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:06:41,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {5699#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5699#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:06:41,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {5699#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 >= 5000000); {5699#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 11:06:41,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {5699#(and (<= 17 main_~x~0) (<= main_~x~0 17))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5700#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:06:41,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {5700#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5700#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:06:41,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {5700#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5700#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 11:06:41,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {5700#(and (<= main_~x~0 18) (<= 18 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5701#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:06:41,405 INFO L290 TraceCheckUtils]: 63: Hoare triple {5701#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5701#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:06:41,405 INFO L290 TraceCheckUtils]: 64: Hoare triple {5701#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 >= 5000000); {5701#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 11:06:41,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {5701#(and (<= 19 main_~x~0) (<= main_~x~0 19))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5702#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:06:41,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {5702#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5702#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:06:41,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {5702#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5702#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 11:06:41,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {5702#(and (<= main_~x~0 20) (<= 20 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5703#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:06:41,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {5703#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5703#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:06:41,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {5703#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 >= 5000000); {5703#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 11:06:41,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {5703#(and (<= 21 main_~x~0) (<= main_~x~0 21))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5704#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:06:41,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {5704#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5704#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:06:41,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {5704#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 >= 5000000); {5704#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 11:06:41,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {5704#(and (<= 22 main_~x~0) (<= main_~x~0 22))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5705#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:06:41,409 INFO L290 TraceCheckUtils]: 75: Hoare triple {5705#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5705#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:06:41,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {5705#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 >= 5000000); {5705#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 11:06:41,410 INFO L290 TraceCheckUtils]: 77: Hoare triple {5705#(and (<= 23 main_~x~0) (<= main_~x~0 23))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:06:41,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {5706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:06:41,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {5706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 11:06:41,411 INFO L290 TraceCheckUtils]: 80: Hoare triple {5706#(and (<= main_~x~0 24) (<= 24 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5707#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:06:41,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {5707#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5707#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:06:41,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {5707#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5707#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 11:06:41,412 INFO L290 TraceCheckUtils]: 83: Hoare triple {5707#(and (<= main_~x~0 25) (<= 25 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5708#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:06:41,412 INFO L290 TraceCheckUtils]: 84: Hoare triple {5708#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5708#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:06:41,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {5708#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5708#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 11:06:41,413 INFO L290 TraceCheckUtils]: 86: Hoare triple {5708#(and (<= main_~x~0 26) (<= 26 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5709#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:06:41,413 INFO L290 TraceCheckUtils]: 87: Hoare triple {5709#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5709#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:06:41,413 INFO L290 TraceCheckUtils]: 88: Hoare triple {5709#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 >= 5000000); {5709#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 11:06:41,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {5709#(and (<= 27 main_~x~0) (<= main_~x~0 27))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5710#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:06:41,415 INFO L290 TraceCheckUtils]: 90: Hoare triple {5710#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5710#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:06:41,415 INFO L290 TraceCheckUtils]: 91: Hoare triple {5710#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 >= 5000000); {5710#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 11:06:41,416 INFO L290 TraceCheckUtils]: 92: Hoare triple {5710#(and (<= 28 main_~x~0) (<= main_~x~0 28))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5711#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:06:41,416 INFO L290 TraceCheckUtils]: 93: Hoare triple {5711#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5711#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:06:41,417 INFO L290 TraceCheckUtils]: 94: Hoare triple {5711#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5711#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 11:06:41,417 INFO L290 TraceCheckUtils]: 95: Hoare triple {5711#(and (<= main_~x~0 29) (<= 29 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5712#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:06:41,417 INFO L290 TraceCheckUtils]: 96: Hoare triple {5712#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5712#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:06:41,418 INFO L290 TraceCheckUtils]: 97: Hoare triple {5712#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 >= 5000000); {5712#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 11:06:41,418 INFO L290 TraceCheckUtils]: 98: Hoare triple {5712#(and (<= 30 main_~x~0) (<= main_~x~0 30))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5713#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:06:41,418 INFO L290 TraceCheckUtils]: 99: Hoare triple {5713#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5713#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:06:41,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {5713#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 >= 5000000); {5713#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 11:06:41,419 INFO L290 TraceCheckUtils]: 101: Hoare triple {5713#(and (<= 31 main_~x~0) (<= main_~x~0 31))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5714#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:06:41,419 INFO L290 TraceCheckUtils]: 102: Hoare triple {5714#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5714#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:06:41,420 INFO L290 TraceCheckUtils]: 103: Hoare triple {5714#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5714#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 11:06:41,420 INFO L290 TraceCheckUtils]: 104: Hoare triple {5714#(and (<= main_~x~0 32) (<= 32 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:06:41,421 INFO L290 TraceCheckUtils]: 105: Hoare triple {5715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:06:41,421 INFO L290 TraceCheckUtils]: 106: Hoare triple {5715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 11:06:41,421 INFO L290 TraceCheckUtils]: 107: Hoare triple {5715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5716#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:06:41,422 INFO L290 TraceCheckUtils]: 108: Hoare triple {5716#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5716#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:06:41,422 INFO L290 TraceCheckUtils]: 109: Hoare triple {5716#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5716#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 11:06:41,422 INFO L290 TraceCheckUtils]: 110: Hoare triple {5716#(and (<= main_~x~0 34) (<= 34 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5717#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:06:41,423 INFO L290 TraceCheckUtils]: 111: Hoare triple {5717#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5717#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:06:41,423 INFO L290 TraceCheckUtils]: 112: Hoare triple {5717#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !(~x~0 % 4294967296 >= 5000000); {5717#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-27 11:06:41,423 INFO L290 TraceCheckUtils]: 113: Hoare triple {5717#(and (<= 35 main_~x~0) (<= main_~x~0 35))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5718#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:06:41,424 INFO L290 TraceCheckUtils]: 114: Hoare triple {5718#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5718#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:06:41,424 INFO L290 TraceCheckUtils]: 115: Hoare triple {5718#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5718#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-27 11:06:41,424 INFO L290 TraceCheckUtils]: 116: Hoare triple {5718#(and (<= main_~x~0 36) (<= 36 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5719#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:06:41,425 INFO L290 TraceCheckUtils]: 117: Hoare triple {5719#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5719#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:06:41,425 INFO L290 TraceCheckUtils]: 118: Hoare triple {5719#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5719#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-27 11:06:41,425 INFO L290 TraceCheckUtils]: 119: Hoare triple {5719#(and (<= main_~x~0 37) (<= 37 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5720#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:06:41,426 INFO L290 TraceCheckUtils]: 120: Hoare triple {5720#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5720#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:06:41,426 INFO L290 TraceCheckUtils]: 121: Hoare triple {5720#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5720#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-27 11:06:41,427 INFO L290 TraceCheckUtils]: 122: Hoare triple {5720#(and (<= main_~x~0 38) (<= 38 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5721#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 11:06:41,427 INFO L290 TraceCheckUtils]: 123: Hoare triple {5721#(and (<= main_~x~0 39) (<= 39 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5721#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 11:06:41,427 INFO L290 TraceCheckUtils]: 124: Hoare triple {5721#(and (<= main_~x~0 39) (<= 39 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5721#(and (<= main_~x~0 39) (<= 39 main_~x~0))} is VALID [2022-04-27 11:06:41,428 INFO L290 TraceCheckUtils]: 125: Hoare triple {5721#(and (<= main_~x~0 39) (<= 39 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5722#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-27 11:06:41,428 INFO L290 TraceCheckUtils]: 126: Hoare triple {5722#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5722#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-27 11:06:41,428 INFO L290 TraceCheckUtils]: 127: Hoare triple {5722#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 128: Hoare triple {5678#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 129: Hoare triple {5678#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 130: Hoare triple {5678#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 131: Hoare triple {5678#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 132: Hoare triple {5678#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 133: Hoare triple {5678#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 134: Hoare triple {5678#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 135: Hoare triple {5678#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 136: Hoare triple {5678#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 137: Hoare triple {5678#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 138: Hoare triple {5678#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L272 TraceCheckUtils]: 139: Hoare triple {5678#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 140: Hoare triple {5678#false} ~cond := #in~cond; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 141: Hoare triple {5678#false} assume 0 == ~cond; {5678#false} is VALID [2022-04-27 11:06:41,429 INFO L290 TraceCheckUtils]: 142: Hoare triple {5678#false} assume !false; {5678#false} is VALID [2022-04-27 11:06:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 447 proven. 2420 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:06:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:06:41,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345787073] [2022-04-27 11:06:41,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345787073] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:06:41,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943763323] [2022-04-27 11:06:41,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:06:41,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:06:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:06:41,439 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:06:41,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 11:06:41,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:06:41,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:06:41,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-27 11:06:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:06:41,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:06:44,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {5677#true} call ULTIMATE.init(); {5677#true} is VALID [2022-04-27 11:06:44,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {5677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5677#true} is VALID [2022-04-27 11:06:44,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {5677#true} assume true; {5677#true} is VALID [2022-04-27 11:06:44,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5677#true} {5677#true} #42#return; {5677#true} is VALID [2022-04-27 11:06:44,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {5677#true} call #t~ret6 := main(); {5677#true} is VALID [2022-04-27 11:06:44,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {5677#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5742#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {5742#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5742#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {5742#(and (= main_~x~0 0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5742#(and (= main_~x~0 0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {5742#(and (= main_~x~0 0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5752#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {5752#(and (= main_~x~0 1) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5752#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {5752#(and (= main_~x~0 1) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5752#(and (= main_~x~0 1) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {5752#(and (= main_~x~0 1) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5762#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 11:06:44,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {5762#(and (= 5000000 main_~z~0) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5762#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 11:06:44,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {5762#(and (= 5000000 main_~z~0) (= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {5762#(and (= 5000000 main_~z~0) (= main_~x~0 2))} is VALID [2022-04-27 11:06:44,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {5762#(and (= 5000000 main_~z~0) (= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5772#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {5772#(and (= main_~x~0 3) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5772#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {5772#(and (= main_~x~0 3) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5772#(and (= main_~x~0 3) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {5772#(and (= main_~x~0 3) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5782#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 11:06:44,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {5782#(and (= 5000000 main_~z~0) (= main_~x~0 4))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5782#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 11:06:44,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {5782#(and (= 5000000 main_~z~0) (= main_~x~0 4))} assume !(~x~0 % 4294967296 >= 5000000); {5782#(and (= 5000000 main_~z~0) (= main_~x~0 4))} is VALID [2022-04-27 11:06:44,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {5782#(and (= 5000000 main_~z~0) (= main_~x~0 4))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5792#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 11:06:44,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {5792#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5792#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 11:06:44,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {5792#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {5792#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} is VALID [2022-04-27 11:06:44,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {5792#(and (= 5000000 main_~z~0) (= 5 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5802#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {5802#(and (= main_~x~0 6) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5802#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {5802#(and (= main_~x~0 6) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5802#(and (= main_~x~0 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {5802#(and (= main_~x~0 6) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5812#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {5812#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5812#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {5812#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5812#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {5812#(and (= (+ (- 1) main_~x~0) 6) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5822#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 11:06:44,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {5822#(and (= 5000000 main_~z~0) (= main_~x~0 8))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5822#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 11:06:44,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {5822#(and (= 5000000 main_~z~0) (= main_~x~0 8))} assume !(~x~0 % 4294967296 >= 5000000); {5822#(and (= 5000000 main_~z~0) (= main_~x~0 8))} is VALID [2022-04-27 11:06:44,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {5822#(and (= 5000000 main_~z~0) (= main_~x~0 8))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5832#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {5832#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5832#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {5832#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5832#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {5832#(and (= (+ (- 1) main_~x~0) 8) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5842#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,127 INFO L290 TraceCheckUtils]: 36: Hoare triple {5842#(and (= main_~x~0 10) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5842#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {5842#(and (= main_~x~0 10) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5842#(and (= main_~x~0 10) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {5842#(and (= main_~x~0 10) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5852#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {5852#(and (= main_~x~0 11) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5852#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {5852#(and (= main_~x~0 11) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5852#(and (= main_~x~0 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {5852#(and (= main_~x~0 11) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5862#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {5862#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5862#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {5862#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5862#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {5862#(and (= (+ (- 1) main_~x~0) 11) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5872#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,130 INFO L290 TraceCheckUtils]: 45: Hoare triple {5872#(and (= main_~x~0 13) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5872#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {5872#(and (= main_~x~0 13) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5872#(and (= main_~x~0 13) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {5872#(and (= main_~x~0 13) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5882#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {5882#(and (= main_~x~0 14) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5882#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {5882#(and (= main_~x~0 14) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5882#(and (= main_~x~0 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {5882#(and (= main_~x~0 14) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5892#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,132 INFO L290 TraceCheckUtils]: 51: Hoare triple {5892#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5892#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {5892#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5892#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {5892#(and (= (+ (- 1) main_~x~0) 14) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5902#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 11:06:44,133 INFO L290 TraceCheckUtils]: 54: Hoare triple {5902#(and (= 5000000 main_~z~0) (= main_~x~0 16))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5902#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 11:06:44,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {5902#(and (= 5000000 main_~z~0) (= main_~x~0 16))} assume !(~x~0 % 4294967296 >= 5000000); {5902#(and (= 5000000 main_~z~0) (= main_~x~0 16))} is VALID [2022-04-27 11:06:44,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {5902#(and (= 5000000 main_~z~0) (= main_~x~0 16))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5912#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {5912#(and (= main_~x~0 17) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5912#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {5912#(and (= main_~x~0 17) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5912#(and (= main_~x~0 17) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {5912#(and (= main_~x~0 17) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5922#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,135 INFO L290 TraceCheckUtils]: 60: Hoare triple {5922#(and (= main_~x~0 18) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5922#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {5922#(and (= main_~x~0 18) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5922#(and (= main_~x~0 18) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {5922#(and (= main_~x~0 18) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5932#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {5932#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5932#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {5932#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5932#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {5932#(and (= 19 main_~x~0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5942#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,137 INFO L290 TraceCheckUtils]: 66: Hoare triple {5942#(and (= main_~x~0 20) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5942#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {5942#(and (= main_~x~0 20) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5942#(and (= main_~x~0 20) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {5942#(and (= main_~x~0 20) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5952#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 11:06:44,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {5952#(and (= 5000000 main_~z~0) (= main_~x~0 21))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5952#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 11:06:44,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {5952#(and (= 5000000 main_~z~0) (= main_~x~0 21))} assume !(~x~0 % 4294967296 >= 5000000); {5952#(and (= 5000000 main_~z~0) (= main_~x~0 21))} is VALID [2022-04-27 11:06:44,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {5952#(and (= 5000000 main_~z~0) (= main_~x~0 21))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5962#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {5962#(and (= main_~x~0 22) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5962#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {5962#(and (= main_~x~0 22) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5962#(and (= main_~x~0 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {5962#(and (= main_~x~0 22) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5972#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {5972#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5972#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {5972#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5972#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {5972#(and (= (+ (- 1) main_~x~0) 22) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5982#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {5982#(and (= main_~x~0 24) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5982#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {5982#(and (= main_~x~0 24) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5982#(and (= main_~x~0 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {5982#(and (= main_~x~0 24) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5992#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {5992#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5992#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {5992#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {5992#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {5992#(and (= (+ (- 1) main_~x~0) 24) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6002#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {6002#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6002#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {6002#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6002#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {6002#(and (= (+ (- 2) main_~x~0) 24) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6012#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {6012#(and (= main_~x~0 27) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6012#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,145 INFO L290 TraceCheckUtils]: 88: Hoare triple {6012#(and (= main_~x~0 27) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6012#(and (= main_~x~0 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,145 INFO L290 TraceCheckUtils]: 89: Hoare triple {6012#(and (= main_~x~0 27) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6022#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,145 INFO L290 TraceCheckUtils]: 90: Hoare triple {6022#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6022#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,146 INFO L290 TraceCheckUtils]: 91: Hoare triple {6022#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6022#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {6022#(and (= (+ (- 1) main_~x~0) 27) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6032#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {6032#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6032#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {6032#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6032#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,147 INFO L290 TraceCheckUtils]: 95: Hoare triple {6032#(and (= 29 main_~x~0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6042#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 11:06:44,147 INFO L290 TraceCheckUtils]: 96: Hoare triple {6042#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6042#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 11:06:44,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {6042#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {6042#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} is VALID [2022-04-27 11:06:44,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {6042#(and (= 5000000 main_~z~0) (= 30 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6052#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,148 INFO L290 TraceCheckUtils]: 99: Hoare triple {6052#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6052#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,149 INFO L290 TraceCheckUtils]: 100: Hoare triple {6052#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6052#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {6052#(and (= (+ (- 1) main_~x~0) 30) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6062#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,149 INFO L290 TraceCheckUtils]: 102: Hoare triple {6062#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6062#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,150 INFO L290 TraceCheckUtils]: 103: Hoare triple {6062#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6062#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,150 INFO L290 TraceCheckUtils]: 104: Hoare triple {6062#(and (= 32 main_~x~0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6072#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,150 INFO L290 TraceCheckUtils]: 105: Hoare triple {6072#(and (= main_~x~0 33) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6072#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,151 INFO L290 TraceCheckUtils]: 106: Hoare triple {6072#(and (= main_~x~0 33) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6072#(and (= main_~x~0 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,151 INFO L290 TraceCheckUtils]: 107: Hoare triple {6072#(and (= main_~x~0 33) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6082#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,151 INFO L290 TraceCheckUtils]: 108: Hoare triple {6082#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6082#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,152 INFO L290 TraceCheckUtils]: 109: Hoare triple {6082#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6082#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,152 INFO L290 TraceCheckUtils]: 110: Hoare triple {6082#(and (= (+ (- 1) main_~x~0) 33) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6092#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,152 INFO L290 TraceCheckUtils]: 111: Hoare triple {6092#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6092#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,153 INFO L290 TraceCheckUtils]: 112: Hoare triple {6092#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6092#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,153 INFO L290 TraceCheckUtils]: 113: Hoare triple {6092#(and (= 35 main_~x~0) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6102#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 11:06:44,153 INFO L290 TraceCheckUtils]: 114: Hoare triple {6102#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6102#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 11:06:44,154 INFO L290 TraceCheckUtils]: 115: Hoare triple {6102#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} assume !(~x~0 % 4294967296 >= 5000000); {6102#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} is VALID [2022-04-27 11:06:44,154 INFO L290 TraceCheckUtils]: 116: Hoare triple {6102#(and (= 5000000 main_~z~0) (= (+ (- 1) main_~x~0) 35))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6112#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,154 INFO L290 TraceCheckUtils]: 117: Hoare triple {6112#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6112#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,155 INFO L290 TraceCheckUtils]: 118: Hoare triple {6112#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6112#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,155 INFO L290 TraceCheckUtils]: 119: Hoare triple {6112#(and (= 35 (+ (- 2) main_~x~0)) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6122#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,155 INFO L290 TraceCheckUtils]: 120: Hoare triple {6122#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6122#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,156 INFO L290 TraceCheckUtils]: 121: Hoare triple {6122#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} assume !(~x~0 % 4294967296 >= 5000000); {6122#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,156 INFO L290 TraceCheckUtils]: 122: Hoare triple {6122#(and (= (+ main_~x~0 (- 3)) 35) (= 5000000 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6132#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 11:06:44,157 INFO L290 TraceCheckUtils]: 123: Hoare triple {6132#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6132#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 11:06:44,157 INFO L290 TraceCheckUtils]: 124: Hoare triple {6132#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} assume !(~x~0 % 4294967296 >= 5000000); {6132#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} is VALID [2022-04-27 11:06:44,157 INFO L290 TraceCheckUtils]: 125: Hoare triple {6132#(and (= 5000000 main_~z~0) (= 35 (+ main_~x~0 (- 4))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6142#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,157 INFO L290 TraceCheckUtils]: 126: Hoare triple {6142#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6142#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} is VALID [2022-04-27 11:06:44,158 INFO L290 TraceCheckUtils]: 127: Hoare triple {6142#(and (= 40 main_~x~0) (= 5000000 main_~z~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6149#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} is VALID [2022-04-27 11:06:44,158 INFO L290 TraceCheckUtils]: 128: Hoare triple {6149#(and (= 40 main_~x~0) (= 5000000 (+ (- 1) main_~z~0)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6153#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-27 11:06:44,159 INFO L290 TraceCheckUtils]: 129: Hoare triple {6153#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6153#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} is VALID [2022-04-27 11:06:44,159 INFO L290 TraceCheckUtils]: 130: Hoare triple {6153#(and (= 5000000 (+ (- 1) main_~z~0)) (= 41 main_~x~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6160#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} is VALID [2022-04-27 11:06:44,159 INFO L290 TraceCheckUtils]: 131: Hoare triple {6160#(and (= 5000002 main_~z~0) (= 41 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6164#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-27 11:06:44,160 INFO L290 TraceCheckUtils]: 132: Hoare triple {6164#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6164#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} is VALID [2022-04-27 11:06:44,160 INFO L290 TraceCheckUtils]: 133: Hoare triple {6164#(and (= 41 (+ (- 1) main_~x~0)) (= 5000002 main_~z~0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6171#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} is VALID [2022-04-27 11:06:44,160 INFO L290 TraceCheckUtils]: 134: Hoare triple {6171#(and (= 41 (+ (- 1) main_~x~0)) (= 5000003 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6175#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:06:44,161 INFO L290 TraceCheckUtils]: 135: Hoare triple {6175#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6175#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} is VALID [2022-04-27 11:06:44,161 INFO L290 TraceCheckUtils]: 136: Hoare triple {6175#(and (= 5000003 main_~z~0) (= 41 (+ (- 2) main_~x~0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6182#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} is VALID [2022-04-27 11:06:44,161 INFO L290 TraceCheckUtils]: 137: Hoare triple {6182#(and (= 41 (+ (- 2) main_~x~0)) (= 5000004 main_~z~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6186#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-27 11:06:44,162 INFO L290 TraceCheckUtils]: 138: Hoare triple {6186#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {6186#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} is VALID [2022-04-27 11:06:44,162 INFO L272 TraceCheckUtils]: 139: Hoare triple {6186#(and (= 44 main_~x~0) (= 5000004 main_~z~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {6193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:06:44,162 INFO L290 TraceCheckUtils]: 140: Hoare triple {6193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:06:44,163 INFO L290 TraceCheckUtils]: 141: Hoare triple {6197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5678#false} is VALID [2022-04-27 11:06:44,163 INFO L290 TraceCheckUtils]: 142: Hoare triple {5678#false} assume !false; {5678#false} is VALID [2022-04-27 11:06:44,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:06:44,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:06:48,026 INFO L290 TraceCheckUtils]: 142: Hoare triple {5678#false} assume !false; {5678#false} is VALID [2022-04-27 11:06:48,027 INFO L290 TraceCheckUtils]: 141: Hoare triple {6197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5678#false} is VALID [2022-04-27 11:06:48,027 INFO L290 TraceCheckUtils]: 140: Hoare triple {6193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:06:48,027 INFO L272 TraceCheckUtils]: 139: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {6193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:06:48,027 INFO L290 TraceCheckUtils]: 138: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,028 INFO L290 TraceCheckUtils]: 137: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,042 INFO L290 TraceCheckUtils]: 136: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,043 INFO L290 TraceCheckUtils]: 135: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,043 INFO L290 TraceCheckUtils]: 134: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,047 INFO L290 TraceCheckUtils]: 133: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,047 INFO L290 TraceCheckUtils]: 132: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,047 INFO L290 TraceCheckUtils]: 131: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,055 INFO L290 TraceCheckUtils]: 130: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,055 INFO L290 TraceCheckUtils]: 129: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,056 INFO L290 TraceCheckUtils]: 128: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,061 INFO L290 TraceCheckUtils]: 127: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := 1 + #t~post4;havoc #t~post4; {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,061 INFO L290 TraceCheckUtils]: 126: Hoare triple {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,062 INFO L290 TraceCheckUtils]: 125: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6213#(not (= (mod main_~z~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:06:48,062 INFO L290 TraceCheckUtils]: 124: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,062 INFO L290 TraceCheckUtils]: 123: Hoare triple {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,063 INFO L290 TraceCheckUtils]: 122: Hoare triple {6266#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6220#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 11:06:48,063 INFO L290 TraceCheckUtils]: 121: Hoare triple {6266#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6266#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,063 INFO L290 TraceCheckUtils]: 120: Hoare triple {6266#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6266#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,063 INFO L290 TraceCheckUtils]: 119: Hoare triple {6276#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6266#(not (= (mod (+ main_~x~0 2) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,064 INFO L290 TraceCheckUtils]: 118: Hoare triple {6276#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6276#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,064 INFO L290 TraceCheckUtils]: 117: Hoare triple {6276#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6276#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,064 INFO L290 TraceCheckUtils]: 116: Hoare triple {6286#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6276#(not (= (mod (+ main_~x~0 3) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,065 INFO L290 TraceCheckUtils]: 115: Hoare triple {6286#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6286#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:06:48,065 INFO L290 TraceCheckUtils]: 114: Hoare triple {6286#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6286#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:06:48,065 INFO L290 TraceCheckUtils]: 113: Hoare triple {6296#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6286#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 4) 4294967296)))} is VALID [2022-04-27 11:06:48,065 INFO L290 TraceCheckUtils]: 112: Hoare triple {6296#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6296#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,066 INFO L290 TraceCheckUtils]: 111: Hoare triple {6296#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6296#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,066 INFO L290 TraceCheckUtils]: 110: Hoare triple {6306#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6296#(not (= (mod main_~z~0 4294967296) (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,066 INFO L290 TraceCheckUtils]: 109: Hoare triple {6306#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6306#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:06:48,067 INFO L290 TraceCheckUtils]: 108: Hoare triple {6306#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6306#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:06:48,068 INFO L290 TraceCheckUtils]: 107: Hoare triple {6316#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6306#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-27 11:06:48,068 INFO L290 TraceCheckUtils]: 106: Hoare triple {6316#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6316#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,068 INFO L290 TraceCheckUtils]: 105: Hoare triple {6316#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6316#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,068 INFO L290 TraceCheckUtils]: 104: Hoare triple {6326#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6316#(not (= (mod main_~z~0 4294967296) (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,069 INFO L290 TraceCheckUtils]: 103: Hoare triple {6326#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6326#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:06:48,069 INFO L290 TraceCheckUtils]: 102: Hoare triple {6326#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6326#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:06:48,069 INFO L290 TraceCheckUtils]: 101: Hoare triple {6336#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6326#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-27 11:06:48,070 INFO L290 TraceCheckUtils]: 100: Hoare triple {6336#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6336#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:06:48,070 INFO L290 TraceCheckUtils]: 99: Hoare triple {6336#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6336#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:06:48,070 INFO L290 TraceCheckUtils]: 98: Hoare triple {6346#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6336#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 9) 4294967296)))} is VALID [2022-04-27 11:06:48,070 INFO L290 TraceCheckUtils]: 97: Hoare triple {6346#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6346#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,071 INFO L290 TraceCheckUtils]: 96: Hoare triple {6346#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6346#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,071 INFO L290 TraceCheckUtils]: 95: Hoare triple {6356#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6346#(not (= (mod (+ main_~x~0 10) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {6356#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6356#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,072 INFO L290 TraceCheckUtils]: 93: Hoare triple {6356#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6356#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,072 INFO L290 TraceCheckUtils]: 92: Hoare triple {6366#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6356#(not (= (mod (+ main_~x~0 11) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,072 INFO L290 TraceCheckUtils]: 91: Hoare triple {6366#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6366#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:06:48,072 INFO L290 TraceCheckUtils]: 90: Hoare triple {6366#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6366#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:06:48,073 INFO L290 TraceCheckUtils]: 89: Hoare triple {6376#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6366#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 12) 4294967296)))} is VALID [2022-04-27 11:06:48,073 INFO L290 TraceCheckUtils]: 88: Hoare triple {6376#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6376#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 11:06:48,073 INFO L290 TraceCheckUtils]: 87: Hoare triple {6376#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6376#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 11:06:48,074 INFO L290 TraceCheckUtils]: 86: Hoare triple {6386#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6376#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-27 11:06:48,074 INFO L290 TraceCheckUtils]: 85: Hoare triple {6386#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6386#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,074 INFO L290 TraceCheckUtils]: 84: Hoare triple {6386#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6386#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,075 INFO L290 TraceCheckUtils]: 83: Hoare triple {6396#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6386#(not (= (mod (+ main_~x~0 14) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,075 INFO L290 TraceCheckUtils]: 82: Hoare triple {6396#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6396#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 11:06:48,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {6396#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6396#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 11:06:48,107 INFO L290 TraceCheckUtils]: 80: Hoare triple {6406#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6396#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-27 11:06:48,107 INFO L290 TraceCheckUtils]: 79: Hoare triple {6406#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6406#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {6406#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6406#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {6416#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6406#(not (= (mod (+ main_~x~0 16) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {6416#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6416#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:06:48,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {6416#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6416#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:06:48,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {6426#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6416#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-27 11:06:48,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {6426#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6426#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {6426#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6426#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,110 INFO L290 TraceCheckUtils]: 71: Hoare triple {6436#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6426#(not (= (mod (+ main_~x~0 18) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {6436#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6436#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,110 INFO L290 TraceCheckUtils]: 69: Hoare triple {6436#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6436#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,111 INFO L290 TraceCheckUtils]: 68: Hoare triple {6446#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6436#(not (= (mod (+ 19 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,111 INFO L290 TraceCheckUtils]: 67: Hoare triple {6446#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6446#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 11:06:48,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {6446#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6446#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 11:06:48,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {6456#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6446#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 20) 4294967296)))} is VALID [2022-04-27 11:06:48,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {6456#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6456#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 11:06:48,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {6456#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6456#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 11:06:48,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {6466#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6456#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 21) 4294967296)))} is VALID [2022-04-27 11:06:48,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {6466#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6466#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {6466#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6466#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {6476#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6466#(not (= (mod (+ main_~x~0 22) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {6476#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6476#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {6476#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6476#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,115 INFO L290 TraceCheckUtils]: 56: Hoare triple {6486#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6476#(not (= (mod (+ 23 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,115 INFO L290 TraceCheckUtils]: 55: Hoare triple {6486#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6486#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 11:06:48,115 INFO L290 TraceCheckUtils]: 54: Hoare triple {6486#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6486#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 11:06:48,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {6496#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6486#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 24) 4294967296)))} is VALID [2022-04-27 11:06:48,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {6496#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6496#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 11:06:48,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {6496#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6496#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 11:06:48,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {6506#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6496#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 25) 4294967296)))} is VALID [2022-04-27 11:06:48,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {6506#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6506#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {6506#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6506#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {6516#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6506#(not (= (mod (+ main_~x~0 26) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {6516#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6516#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {6516#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6516#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,119 INFO L290 TraceCheckUtils]: 44: Hoare triple {6526#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6516#(not (= (mod (+ main_~x~0 27) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {6526#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6526#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {6526#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6526#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,120 INFO L290 TraceCheckUtils]: 41: Hoare triple {6536#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6526#(not (= (mod (+ main_~x~0 28) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {6536#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6536#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {6536#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6536#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {6546#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6536#(not (= (mod main_~z~0 4294967296) (mod (+ 29 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,122 INFO L290 TraceCheckUtils]: 37: Hoare triple {6546#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6546#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {6546#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6546#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {6556#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6546#(not (= (mod main_~z~0 4294967296) (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,122 INFO L290 TraceCheckUtils]: 34: Hoare triple {6556#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6556#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {6556#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6556#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {6566#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6556#(not (= (mod (+ main_~x~0 31) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {6566#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6566#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,124 INFO L290 TraceCheckUtils]: 30: Hoare triple {6566#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6566#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,124 INFO L290 TraceCheckUtils]: 29: Hoare triple {6576#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6566#(not (= (mod (+ 32 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {6576#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6576#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 11:06:48,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {6576#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6576#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 11:06:48,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {6586#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6576#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 33) 4294967296)))} is VALID [2022-04-27 11:06:48,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {6586#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6586#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 11:06:48,125 INFO L290 TraceCheckUtils]: 24: Hoare triple {6586#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6586#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 11:06:48,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {6596#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6586#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-27 11:06:48,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {6596#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6596#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {6596#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6596#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {6606#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6596#(not (= (mod (+ 35 main_~x~0) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {6606#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6606#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {6606#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6606#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {6616#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6606#(not (= (mod (+ main_~x~0 36) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {6616#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6616#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 11:06:48,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {6616#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6616#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 11:06:48,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {6626#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6616#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 37) 4294967296)))} is VALID [2022-04-27 11:06:48,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {6626#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6626#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {6626#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6626#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {6636#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6626#(not (= (mod (+ main_~x~0 38) 4294967296) (mod main_~z~0 4294967296)))} is VALID [2022-04-27 11:06:48,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {6636#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6636#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 11:06:48,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {6636#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6636#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 11:06:48,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {6646#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {6636#(not (= (mod main_~z~0 4294967296) (mod (+ main_~x~0 39) 4294967296)))} is VALID [2022-04-27 11:06:48,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {6646#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 >= 5000000); {6646#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {6646#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {6646#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {5677#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {6646#(not (= (mod main_~z~0 4294967296) (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-27 11:06:48,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {5677#true} call #t~ret6 := main(); {5677#true} is VALID [2022-04-27 11:06:48,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5677#true} {5677#true} #42#return; {5677#true} is VALID [2022-04-27 11:06:48,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {5677#true} assume true; {5677#true} is VALID [2022-04-27 11:06:48,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {5677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5677#true} is VALID [2022-04-27 11:06:48,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {5677#true} call ULTIMATE.init(); {5677#true} is VALID [2022-04-27 11:06:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:06:48,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943763323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:06:48,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:06:48,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 53, 45] total 136 [2022-04-27 11:06:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744902129] [2022-04-27 11:06:48,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:06:48,137 INFO L78 Accepts]: Start accepts. Automaton has has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 143 [2022-04-27 11:06:48,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:06:48,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:48,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:06:48,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-04-27 11:06:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:06:48,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-04-27 11:06:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=15960, Unknown=0, NotChecked=0, Total=18360 [2022-04-27 11:06:48,335 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 136 states, 136 states have (on average 2.889705882352941) internal successors, (393), 134 states have internal predecessors, (393), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:06:59,448 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:01,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:03,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= (mod (+ 40 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:05,629 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:08,050 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 39 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:10,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:12,171 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= .cse0 (mod (+ 38 c_main_~x~0) 4294967296))) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:14,185 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:16,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 37) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:18,216 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:20,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 36 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:22,599 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:24,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:26,642 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:28,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 34 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:30,676 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:32,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 33 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:34,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:36,714 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 32 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:38,726 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:40,741 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 31 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:42,754 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:44,785 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= (mod (+ 30 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:46,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:48,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 29 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:50,845 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:07:52,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 28 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:12:42,021 WARN L232 SmtUtils]: Spent 1.84m on a formula simplification that was a NOOP. DAG size: 143 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:12:44,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:46,036 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:48,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:50,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:52,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:54,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:12:56,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:13:05,590 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:13:07,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:13:09,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:13:11,614 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:13:13,628 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-04-27 11:13:15,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 27) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:13:17,674 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:13:19,686 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 26 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:13:21,732 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:13:23,748 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 25 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:13:25,759 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 24) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))))) is different from false [2022-04-27 11:17:55,358 WARN L232 SmtUtils]: Spent 1.54m on a formula simplification that was a NOOP. DAG size: 125 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:17:58,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:03,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:13,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:15,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:17,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:19,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:21,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:27,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:30,485 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:32,492 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:34,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:18:36,517 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~z~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= (mod (+ c_main_~x~0 11) 4294967296) .cse0)) (not (= .cse0 (mod (+ 15 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 16 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 2 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 14 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 20 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 17 c_main_~x~0) 4294967296))) (not (= (mod (+ 19 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 3 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 12 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 21 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 10 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 9 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 23 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 5 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 4 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 13 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 18 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ 22 c_main_~x~0) 4294967296))) (not (= .cse0 (mod (+ c_main_~x~0 1) 4294967296))) (not (= (mod (+ 8 c_main_~x~0) 4294967296) .cse0)) (not (= .cse0 (mod (+ 6 c_main_~x~0) 4294967296))) (not (= .cse0 (mod c_main_~x~0 4294967296))) (not (= .cse0 (mod (+ 7 c_main_~x~0) 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false