/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/Mono5_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:01:55,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:01:55,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:01:56,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:01:56,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:01:56,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:01:56,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:01:56,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:01:56,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:01:56,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:01:56,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:01:56,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:01:56,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:01:56,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:01:56,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:01:56,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:01:56,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:01:56,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:01:56,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:01:56,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:01:56,021 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:01:56,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:01:56,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:01:56,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:01:56,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:01:56,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:01:56,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:01:56,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:01:56,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:01:56,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:01:56,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:01:56,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:01:56,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:01:56,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:01:56,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:01:56,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:01:56,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:01:56,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:01:56,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:01:56,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:01:56,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:01:56,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:01:56,031 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:01:56,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:01:56,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:01:56,044 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:01:56,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:01:56,045 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:01:56,045 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:01:56,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:01:56,046 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:01:56,046 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:01:56,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:01:56,046 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:01:56,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:01:56,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:01:56,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:01:56,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:01:56,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:01:56,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:01:56,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:01:56,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:01:56,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:01:56,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:01:56,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:01:56,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:01:56,049 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:01:56,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:01:56,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:01:56,049 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:01:56,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:01:56,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:01:56,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:01:56,228 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:01:56,240 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:01:56,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2022-04-27 11:01:56,291 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad86937e/5412f1a1790c47f39b75eb2fde1c8481/FLAG964901e4b [2022-04-27 11:01:56,616 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:01:56,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono5_1.c [2022-04-27 11:01:56,621 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad86937e/5412f1a1790c47f39b75eb2fde1c8481/FLAG964901e4b [2022-04-27 11:01:56,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fad86937e/5412f1a1790c47f39b75eb2fde1c8481 [2022-04-27 11:01:56,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:01:56,639 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:01:56,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:01:56,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:01:56,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:01:56,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6e4fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56, skipping insertion in model container [2022-04-27 11:01:56,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:01:56,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:01:56,819 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/Mono5_1.c[311,324] [2022-04-27 11:01:56,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:01:56,850 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:01:56,859 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/Mono5_1.c[311,324] [2022-04-27 11:01:56,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:01:56,874 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:01:56,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56 WrapperNode [2022-04-27 11:01:56,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:01:56,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:01:56,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:01:56,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:01:56,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:01:56,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:01:56,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:01:56,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:01:56,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (1/1) ... [2022-04-27 11:01:56,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:01:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:56,926 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:01:56,932 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:01:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:01:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:01:56,958 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:01:56,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:01:56,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:01:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:01:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:01:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:01:56,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:01:56,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:01:57,008 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:01:57,009 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:01:57,094 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:01:57,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:01:57,098 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:01:57,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:01:57 BoogieIcfgContainer [2022-04-27 11:01:57,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:01:57,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:01:57,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:01:57,113 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:01:57,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:01:56" (1/3) ... [2022-04-27 11:01:57,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70817856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:01:57, skipping insertion in model container [2022-04-27 11:01:57,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:01:56" (2/3) ... [2022-04-27 11:01:57,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70817856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:01:57, skipping insertion in model container [2022-04-27 11:01:57,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:01:57" (3/3) ... [2022-04-27 11:01:57,127 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono5_1.c [2022-04-27 11:01:57,137 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:01:57,137 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:01:57,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:01:57,196 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@14ba50ea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e3059fc [2022-04-27 11:01:57,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:01:57,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:01:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:01:57,208 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:57,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:57,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1326077006, now seen corresponding path program 1 times [2022-04-27 11:01:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:57,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523185442] [2022-04-27 11:01:57,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:57,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:57,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:57,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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); {23#true} is VALID [2022-04-27 11:01:57,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:01:57,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-27 11:01:57,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:57,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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); {23#true} is VALID [2022-04-27 11:01:57,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:01:57,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #41#return; {23#true} is VALID [2022-04-27 11:01:57,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-27 11:01:57,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {23#true} is VALID [2022-04-27 11:01:57,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 11:01:57,401 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-27 11:01:57,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:01:57,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:01:57,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:01:57,402 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:01:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:57,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523185442] [2022-04-27 11:01:57,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523185442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:01:57,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:01:57,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:01:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44826520] [2022-04-27 11:01:57,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:01:57,410 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:01:57,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:57,413 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:01:57,433 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:01:57,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:01:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:57,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:01:57,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:01:57,453 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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:01:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:57,528 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-27 11:01:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:01:57,529 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:01:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:57,530 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:01:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 11:01:57,537 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:01:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 11:01:57,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 11:01:57,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:57,601 INFO L225 Difference]: With dead ends: 31 [2022-04-27 11:01:57,601 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 11:01:57,603 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:01:57,605 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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:01:57,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:01:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 11:01:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 11:01:57,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:57,634 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:01:57,635 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:01:57,639 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:01:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:57,645 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:01:57,645 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:01:57,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:57,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:57,647 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:01:57,647 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:01:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:57,650 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 11:01:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:01:57,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:57,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:57,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:57,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:57,651 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:01:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 11:01:57,653 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-27 11:01:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:57,653 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 11:01:57,654 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:01:57,654 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 11:01:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:01:57,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:57,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:57,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:01:57,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:57,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:57,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1315918275, now seen corresponding path program 1 times [2022-04-27 11:01:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:57,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478690027] [2022-04-27 11:01:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:57,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(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); {120#true} is VALID [2022-04-27 11:01:57,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 11:01:57,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120#true} {120#true} #41#return; {120#true} is VALID [2022-04-27 11:01:57,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {120#true} call ULTIMATE.init(); {128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:57,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#(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); {120#true} is VALID [2022-04-27 11:01:57,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#true} assume true; {120#true} is VALID [2022-04-27 11:01:57,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#true} {120#true} #41#return; {120#true} is VALID [2022-04-27 11:01:57,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {120#true} call #t~ret6 := main(); {120#true} is VALID [2022-04-27 11:01:57,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {125#(and (<= 5000000 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:57,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {125#(and (<= 5000000 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {125#(and (<= 5000000 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:57,829 INFO L272 TraceCheckUtils]: 7: Hoare triple {125#(and (<= 5000000 main_~z~0) (<= (div main_~z~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:01:57,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {127#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:01:57,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {127#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {121#false} is VALID [2022-04-27 11:01:57,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {121#false} assume !false; {121#false} is VALID [2022-04-27 11:01:57,830 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:01:57,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478690027] [2022-04-27 11:01:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478690027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:01:57,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:01:57,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:01:57,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609425820] [2022-04-27 11:01:57,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:01:57,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:57,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:57,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:57,848 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:01:57,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:01:57,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:57,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:01:57,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:01:57,849 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:57,994 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 11:01:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:01:57,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:57,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:57,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 11:01:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-27 11:01:57,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-27 11:01:58,015 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:01:58,016 INFO L225 Difference]: With dead ends: 22 [2022-04-27 11:01:58,016 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 11:01:58,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:01:58,017 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:58,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:01:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 11:01:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 11:01:58,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:58,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:01:58,022 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:01:58,022 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:01:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:58,023 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:01:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:01:58,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:58,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:58,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:01:58,023 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:01:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:58,024 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-27 11:01:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:01:58,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:58,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:58,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:58,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:01:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 11:01:58,026 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-27 11:01:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:58,026 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 11:01:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 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:01:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 11:01:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:01:58,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:58,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:58,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:01:58,027 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 644646283, now seen corresponding path program 1 times [2022-04-27 11:01:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:58,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540219202] [2022-04-27 11:01:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:58,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {234#(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:01:58,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:01:58,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #41#return; {228#true} is VALID [2022-04-27 11:01:58,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:58,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#(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:01:58,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2022-04-27 11:01:58,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #41#return; {228#true} is VALID [2022-04-27 11:01:58,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2022-04-27 11:01:58,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {228#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {233#(= main_~x~0 0)} is VALID [2022-04-27 11:01:58,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {233#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {233#(= main_~x~0 0)} is VALID [2022-04-27 11:01:58,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {233#(= main_~x~0 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {229#false} is VALID [2022-04-27 11:01:58,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {229#false} is VALID [2022-04-27 11:01:58,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {229#false} is VALID [2022-04-27 11:01:58,094 INFO L272 TraceCheckUtils]: 10: Hoare triple {229#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {229#false} is VALID [2022-04-27 11:01:58,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2022-04-27 11:01:58,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2022-04-27 11:01:58,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-04-27 11:01:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:01:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540219202] [2022-04-27 11:01:58,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540219202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:01:58,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:01:58,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:01:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829392892] [2022-04-27 11:01:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:01:58,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-27 11:01:58,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:58,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:58,106 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:01:58,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:01:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:58,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:01:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:01:58,107 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:58,162 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 11:01:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 11:01:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-27 11:01:58,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 11:01:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 11:01:58,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 11:01:58,185 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:01:58,185 INFO L225 Difference]: With dead ends: 28 [2022-04-27 11:01:58,185 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 11:01:58,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:01:58,187 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:58,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:01:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 11:01:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-27 11:01:58,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:58,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:01:58,192 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:01:58,192 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:01:58,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:58,193 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 11:01:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:01:58,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:58,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:58,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 20 states. [2022-04-27 11:01:58,194 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 20 states. [2022-04-27 11:01:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:58,195 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-27 11:01:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 11:01:58,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:58,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:58,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:58,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:01:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-27 11:01:58,196 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-04-27 11:01:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:58,196 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-27 11:01:58,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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:01:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 11:01:58,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:01:58,197 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:58,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:58,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:01:58,197 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash -244564223, now seen corresponding path program 1 times [2022-04-27 11:01:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:58,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142104476] [2022-04-27 11:01:58,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:58,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:58,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#(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); {347#true} is VALID [2022-04-27 11:01:58,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-27 11:01:58,270 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {347#true} {347#true} #41#return; {347#true} is VALID [2022-04-27 11:01:58,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:58,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#(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); {347#true} is VALID [2022-04-27 11:01:58,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-27 11:01:58,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #41#return; {347#true} is VALID [2022-04-27 11:01:58,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} call #t~ret6 := main(); {347#true} is VALID [2022-04-27 11:01:58,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {352#(= main_~x~0 0)} is VALID [2022-04-27 11:01:58,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {352#(= main_~x~0 0)} is VALID [2022-04-27 11:01:58,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {352#(= main_~x~0 0)} is VALID [2022-04-27 11:01:58,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {352#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {353#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:01:58,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {353#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {353#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:01:58,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {353#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {348#false} is VALID [2022-04-27 11:01:58,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {348#false} is VALID [2022-04-27 11:01:58,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {348#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {348#false} is VALID [2022-04-27 11:01:58,283 INFO L272 TraceCheckUtils]: 13: Hoare triple {348#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {348#false} is VALID [2022-04-27 11:01:58,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {348#false} ~cond := #in~cond; {348#false} is VALID [2022-04-27 11:01:58,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {348#false} assume 0 == ~cond; {348#false} is VALID [2022-04-27 11:01:58,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-27 11:01:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:01:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142104476] [2022-04-27 11:01:58,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142104476] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746181274] [2022-04-27 11:01:58,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:58,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:58,286 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:01:58,287 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:01:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:58,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:01:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:58,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:58,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-27 11:01:58,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#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); {347#true} is VALID [2022-04-27 11:01:58,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-27 11:01:58,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #41#return; {347#true} is VALID [2022-04-27 11:01:58,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} call #t~ret6 := main(); {347#true} is VALID [2022-04-27 11:01:58,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {373#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:58,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {373#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {373#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:58,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {373#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:58,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {373#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:58,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {373#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {373#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:58,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {373#(= 5000000 main_~z~0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {389#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:58,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#(= 5000000 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {389#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:58,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {389#(= 5000000 (+ main_~z~0 1))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {389#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:58,499 INFO L272 TraceCheckUtils]: 13: Hoare triple {389#(= 5000000 (+ main_~z~0 1))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:58,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:58,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {348#false} is VALID [2022-04-27 11:01:58,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-27 11:01:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:01:58,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:58,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {348#false} assume !false; {348#false} is VALID [2022-04-27 11:01:58,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {348#false} is VALID [2022-04-27 11:01:58,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:58,701 INFO L272 TraceCheckUtils]: 13: Hoare triple {419#(not (= (mod main_~z~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:58,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(not (= (mod main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {419#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:58,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(not (= (mod main_~z~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {419#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:58,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {419#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:58,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:58,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:58,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:58,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:58,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {347#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {429#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:58,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {347#true} call #t~ret6 := main(); {347#true} is VALID [2022-04-27 11:01:58,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #41#return; {347#true} is VALID [2022-04-27 11:01:58,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2022-04-27 11:01:58,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {347#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); {347#true} is VALID [2022-04-27 11:01:58,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2022-04-27 11:01:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:01:58,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746181274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:58,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:58,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-27 11:01:58,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173175418] [2022-04-27 11:01:58,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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 17 [2022-04-27 11:01:58,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:58,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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:01:58,738 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:01:58,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:01:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:01:58,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:01:58,742 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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:01:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:59,039 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 11:01:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:01:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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 17 [2022-04-27 11:01:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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:01:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-27 11:01:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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:01:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2022-04-27 11:01:59,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2022-04-27 11:01:59,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:59,089 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:01:59,089 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 11:01:59,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:01:59,091 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:59,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 50 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:01:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 11:01:59,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-27 11:01:59,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:59,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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:01:59,111 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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:01:59,111 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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:01:59,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:59,113 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-27 11:01:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 11:01:59,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:59,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:59,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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 32 states. [2022-04-27 11:01:59,113 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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 32 states. [2022-04-27 11:01:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:59,117 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-27 11:01:59,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 11:01:59,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:59,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:59,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:59,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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:01:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-27 11:01:59,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 17 [2022-04-27 11:01:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:59,120 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-27 11:01:59,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 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:01:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-27 11:01:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 11:01:59,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:01:59,121 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:01:59,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:01:59,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:59,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:01:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:01:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1700850563, now seen corresponding path program 2 times [2022-04-27 11:01:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:01:59,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43939464] [2022-04-27 11:01:59,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:01:59,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:01:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:01:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:59,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {659#(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); {651#true} is VALID [2022-04-27 11:01:59,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-27 11:01:59,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-27 11:01:59,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {659#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:01:59,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#(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); {651#true} is VALID [2022-04-27 11:01:59,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-27 11:01:59,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-27 11:01:59,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2022-04-27 11:01:59,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {656#(= main_~x~0 0)} is VALID [2022-04-27 11:01:59,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {656#(= main_~x~0 0)} is VALID [2022-04-27 11:01:59,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {656#(= main_~x~0 0)} is VALID [2022-04-27 11:01:59,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {656#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {657#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:59,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {657#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:59,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {657#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {657#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:01:59,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {657#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {658#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:59,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {658#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {658#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 11:01:59,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {658#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {652#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {652#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {652#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {652#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {652#false} is VALID [2022-04-27 11:01:59,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {652#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {652#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {652#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {652#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {652#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {652#false} is VALID [2022-04-27 11:01:59,432 INFO L272 TraceCheckUtils]: 25: Hoare triple {652#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 27: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2022-04-27 11:01:59,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-27 11:01:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:01:59,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:01:59,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43939464] [2022-04-27 11:01:59,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43939464] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:01:59,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647241339] [2022-04-27 11:01:59,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:01:59,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:01:59,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:01:59,434 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:01:59,458 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:01:59,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:01:59,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:01:59,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:01:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:01:59,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:01:59,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2022-04-27 11:01:59,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#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); {651#true} is VALID [2022-04-27 11:01:59,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-27 11:01:59,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-27 11:01:59,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2022-04-27 11:01:59,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {678#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:01:59,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#(= 5000000 main_~z~0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {703#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:59,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {703#(= 5000000 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {703#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:59,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {703#(= 5000000 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {703#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:59,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {703#(= 5000000 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {713#(= 5000000 (+ main_~z~0 2))} is VALID [2022-04-27 11:01:59,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {713#(= 5000000 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {713#(= 5000000 (+ main_~z~0 2))} is VALID [2022-04-27 11:01:59,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {713#(= 5000000 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {713#(= 5000000 (+ main_~z~0 2))} is VALID [2022-04-27 11:01:59,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {713#(= 5000000 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {723#(= 4999998 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:59,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {723#(= 4999998 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {723#(= 4999998 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:59,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {723#(= 4999998 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {723#(= 4999998 (+ main_~z~0 1))} is VALID [2022-04-27 11:01:59,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {723#(= 4999998 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {733#(= 4999998 (+ main_~z~0 2))} is VALID [2022-04-27 11:01:59,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {733#(= 4999998 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {733#(= 4999998 (+ main_~z~0 2))} is VALID [2022-04-27 11:01:59,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {733#(= 4999998 (+ main_~z~0 2))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {733#(= 4999998 (+ main_~z~0 2))} is VALID [2022-04-27 11:01:59,661 INFO L272 TraceCheckUtils]: 25: Hoare triple {733#(= 4999998 (+ main_~z~0 2))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:59,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:59,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {652#false} is VALID [2022-04-27 11:01:59,662 INFO L290 TraceCheckUtils]: 28: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-27 11:01:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:01:59,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:01:59,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-27 11:01:59,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {652#false} is VALID [2022-04-27 11:01:59,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:01:59,864 INFO L272 TraceCheckUtils]: 25: Hoare triple {763#(not (= (mod main_~z~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:01:59,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {763#(not (= (mod main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {763#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:59,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {763#(not (= (mod main_~z~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {763#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:59,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {773#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {763#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:01:59,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {773#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {773#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:59,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {773#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {773#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:59,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {773#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:01:59,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {783#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {783#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:59,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {783#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {783#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:59,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {793#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {783#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:01:59,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {793#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {793#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:01:59,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {793#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {793#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:01:59,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {793#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:01:59,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {803#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:01:59,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret6 := main(); {651#true} is VALID [2022-04-27 11:01:59,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #41#return; {651#true} is VALID [2022-04-27 11:01:59,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-27 11:01:59,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#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); {651#true} is VALID [2022-04-27 11:01:59,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2022-04-27 11:01:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 11:01:59,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647241339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:01:59,883 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:01:59,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 18 [2022-04-27 11:01:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993117813] [2022-04-27 11:01:59,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:01:59,884 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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 29 [2022-04-27 11:01:59,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:01:59,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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:01:59,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:59,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:01:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:01:59,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:01:59,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-04-27 11:01:59,928 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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:02:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:00,773 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-27 11:02:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:02:00,774 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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 29 [2022-04-27 11:02:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:02:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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:02:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 88 transitions. [2022-04-27 11:02:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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:02:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 88 transitions. [2022-04-27 11:02:00,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 88 transitions. [2022-04-27 11:02:00,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:00,853 INFO L225 Difference]: With dead ends: 78 [2022-04-27 11:02:00,853 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 11:02:00,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=824, Unknown=0, NotChecked=0, Total=1056 [2022-04-27 11:02:00,854 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 129 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:02:00,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 74 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:02:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 11:02:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-27 11:02:00,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:02:00,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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:02:00,865 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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:02:00,865 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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:02:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:00,867 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-27 11:02:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-27 11:02:00,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:00,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:00,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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 53 states. [2022-04-27 11:02:00,868 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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 53 states. [2022-04-27 11:02:00,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:00,869 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-04-27 11:02:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-04-27 11:02:00,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:00,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:00,870 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:02:00,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:02:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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:02:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-04-27 11:02:00,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 29 [2022-04-27 11:02:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:02:00,871 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-04-27 11:02:00,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 16 states have internal predecessors, (53), 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:02:00,872 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-04-27 11:02:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 11:02:00,872 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:02:00,872 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:02:00,891 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:02:01,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:01,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:02:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:02:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1613179341, now seen corresponding path program 3 times [2022-04-27 11:02:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:02:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071554177] [2022-04-27 11:02:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:02:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:02:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:02:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:01,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#(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); {1164#true} is VALID [2022-04-27 11:02:01,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {1164#true} assume true; {1164#true} is VALID [2022-04-27 11:02:01,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1164#true} {1164#true} #41#return; {1164#true} is VALID [2022-04-27 11:02:01,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {1164#true} call ULTIMATE.init(); {1173#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:02:01,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#(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); {1164#true} is VALID [2022-04-27 11:02:01,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {1164#true} assume true; {1164#true} is VALID [2022-04-27 11:02:01,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1164#true} {1164#true} #41#return; {1164#true} is VALID [2022-04-27 11:02:01,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {1164#true} call #t~ret6 := main(); {1164#true} is VALID [2022-04-27 11:02:01,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {1164#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1169#(= main_~x~0 0)} is VALID [2022-04-27 11:02:01,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {1169#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1169#(= main_~x~0 0)} is VALID [2022-04-27 11:02:01,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {1169#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {1169#(= main_~x~0 0)} is VALID [2022-04-27 11:02:01,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {1169#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1170#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:01,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1170#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1170#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:01,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {1170#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1170#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:01,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {1170#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1171#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:01,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {1171#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1171#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:01,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {1171#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1171#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:01,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {1171#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1172#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 11:02:01,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {1172#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1172#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 11:02:01,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 43: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {1165#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,248 INFO L272 TraceCheckUtils]: 46: Hoare triple {1165#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1165#false} is VALID [2022-04-27 11:02:01,252 INFO L290 TraceCheckUtils]: 47: Hoare triple {1165#false} ~cond := #in~cond; {1165#false} is VALID [2022-04-27 11:02:01,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {1165#false} assume 0 == ~cond; {1165#false} is VALID [2022-04-27 11:02:01,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {1165#false} assume !false; {1165#false} is VALID [2022-04-27 11:02:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:02:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:02:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071554177] [2022-04-27 11:02:01,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071554177] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:02:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769569047] [2022-04-27 11:02:01,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:02:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:01,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:02:01,260 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:02:01,269 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:02:01,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-04-27 11:02:01,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:02:01,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:02:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:01,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:02:01,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {1164#true} call ULTIMATE.init(); {1164#true} is VALID [2022-04-27 11:02:01,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1164#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); {1164#true} is VALID [2022-04-27 11:02:01,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1164#true} assume true; {1164#true} is VALID [2022-04-27 11:02:01,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1164#true} {1164#true} #41#return; {1164#true} is VALID [2022-04-27 11:02:01,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {1164#true} call #t~ret6 := main(); {1164#true} is VALID [2022-04-27 11:02:01,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1164#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1192#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:02:01,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {1192#(and (= main_~x~0 0) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1192#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:02:01,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {1192#(and (= main_~x~0 0) (= main_~y~0 10000000))} assume !(~x~0 % 4294967296 >= 5000000); {1192#(and (= main_~x~0 0) (= main_~y~0 10000000))} is VALID [2022-04-27 11:02:01,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {1192#(and (= main_~x~0 0) (= main_~y~0 10000000))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1202#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-27 11:02:01,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(and (= main_~y~0 10000000) (= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1202#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-27 11:02:01,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {1202#(and (= main_~y~0 10000000) (= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1202#(and (= main_~y~0 10000000) (= main_~x~0 1))} is VALID [2022-04-27 11:02:01,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {1202#(and (= main_~y~0 10000000) (= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1212#(and (= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-27 11:02:01,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#(and (= main_~y~0 10000000) (= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1212#(and (= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-27 11:02:01,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {1212#(and (= main_~y~0 10000000) (= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1212#(and (= main_~y~0 10000000) (= main_~x~0 2))} is VALID [2022-04-27 11:02:01,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {1212#(and (= main_~y~0 10000000) (= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1222#(and (= main_~x~0 3) (= main_~y~0 10000000))} is VALID [2022-04-27 11:02:01,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {1222#(and (= main_~x~0 3) (= main_~y~0 10000000))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1226#(= main_~x~0 3)} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {1226#(= main_~x~0 3)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 28: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 32: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,587 INFO L290 TraceCheckUtils]: 33: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,588 INFO L290 TraceCheckUtils]: 35: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 37: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 39: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 40: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 41: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 42: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 45: Hoare triple {1165#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L272 TraceCheckUtils]: 46: Hoare triple {1165#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {1165#false} ~cond := #in~cond; {1165#false} is VALID [2022-04-27 11:02:01,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {1165#false} assume 0 == ~cond; {1165#false} is VALID [2022-04-27 11:02:01,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {1165#false} assume !false; {1165#false} is VALID [2022-04-27 11:02:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:02:01,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:02:01,829 INFO L290 TraceCheckUtils]: 49: Hoare triple {1165#false} assume !false; {1165#false} is VALID [2022-04-27 11:02:01,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {1165#false} assume 0 == ~cond; {1165#false} is VALID [2022-04-27 11:02:01,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {1165#false} ~cond := #in~cond; {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L272 TraceCheckUtils]: 46: Hoare triple {1165#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {1165#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 43: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 42: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 41: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 40: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,832 INFO L290 TraceCheckUtils]: 39: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {1165#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {1165#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {1165#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1165#false} is VALID [2022-04-27 11:02:01,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(not (<= 5000000 (mod main_~x~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1165#false} is VALID [2022-04-27 11:02:01,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {1432#(or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1428#(not (<= 5000000 (mod main_~x~0 4294967296)))} is VALID [2022-04-27 11:02:01,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1432#(or (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:02:01,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {1436#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-27 11:02:01,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {1436#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1436#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-27 11:02:01,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1436#(or (not (< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 1) 4294967296))))} is VALID [2022-04-27 11:02:01,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {1446#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:02:01,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {1446#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1446#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:02:01,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {1456#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1446#(or (not (<= 5000000 (mod (+ main_~x~0 2) 4294967296))) (not (< (mod (+ main_~x~0 2) 4294967296) (mod main_~y~0 4294967296))))} is VALID [2022-04-27 11:02:01,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {1456#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} assume !(~x~0 % 4294967296 >= 5000000); {1456#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:02:01,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {1456#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1456#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:02:01,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {1164#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1456#(or (not (< (mod (+ main_~x~0 3) 4294967296) (mod main_~y~0 4294967296))) (not (<= 5000000 (mod (+ main_~x~0 3) 4294967296))))} is VALID [2022-04-27 11:02:01,841 INFO L272 TraceCheckUtils]: 4: Hoare triple {1164#true} call #t~ret6 := main(); {1164#true} is VALID [2022-04-27 11:02:01,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1164#true} {1164#true} #41#return; {1164#true} is VALID [2022-04-27 11:02:01,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {1164#true} assume true; {1164#true} is VALID [2022-04-27 11:02:01,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {1164#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); {1164#true} is VALID [2022-04-27 11:02:01,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {1164#true} call ULTIMATE.init(); {1164#true} is VALID [2022-04-27 11:02:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 106 proven. 15 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:02:01,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769569047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:02:01,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:02:01,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-04-27 11:02:01,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181817165] [2022-04-27 11:02:01,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:02:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 50 [2022-04-27 11:02:01,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:02:01,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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:02:01,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:01,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:02:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:02:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:02:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:02:01,877 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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:02:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:02,671 INFO L93 Difference]: Finished difference Result 112 states and 138 transitions. [2022-04-27 11:02:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:02:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 50 [2022-04-27 11:02:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:02:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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:02:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2022-04-27 11:02:02,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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:02:02,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 53 transitions. [2022-04-27 11:02:02,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 53 transitions. [2022-04-27 11:02:02,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:02,734 INFO L225 Difference]: With dead ends: 112 [2022-04-27 11:02:02,734 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 11:02:02,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=577, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:02:02,735 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:02:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 49 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:02:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 11:02:02,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-04-27 11:02:02,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:02:02,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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:02:02,769 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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:02:02,769 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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:02:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:02,771 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 11:02:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-27 11:02:02,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:02,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:02,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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 77 states. [2022-04-27 11:02:02,772 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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 77 states. [2022-04-27 11:02:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:02,774 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-04-27 11:02:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-04-27 11:02:02,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:02,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:02,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:02:02,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:02:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 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:02:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-04-27 11:02:02,776 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 50 [2022-04-27 11:02:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:02:02,776 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-04-27 11:02:02,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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:02:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-04-27 11:02:02,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-27 11:02:02,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:02:02,778 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:02:02,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 11:02:02,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:02,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:02:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:02:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1138063299, now seen corresponding path program 4 times [2022-04-27 11:02:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:02:02,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749151627] [2022-04-27 11:02:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:02:02,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:02:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:02:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:03,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1916#(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); {1902#true} is VALID [2022-04-27 11:02:03,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-27 11:02:03,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1902#true} {1902#true} #41#return; {1902#true} is VALID [2022-04-27 11:02:03,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {1902#true} call ULTIMATE.init(); {1916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:02:03,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {1916#(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); {1902#true} is VALID [2022-04-27 11:02:03,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-27 11:02:03,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#true} {1902#true} #41#return; {1902#true} is VALID [2022-04-27 11:02:03,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#true} call #t~ret6 := main(); {1902#true} is VALID [2022-04-27 11:02:03,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1907#(= main_~x~0 0)} is VALID [2022-04-27 11:02:03,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {1907#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1907#(= main_~x~0 0)} is VALID [2022-04-27 11:02:03,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1907#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {1907#(= main_~x~0 0)} is VALID [2022-04-27 11:02:03,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1907#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:03,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {1908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:03,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {1908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:03,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1908#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:03,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {1909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:03,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {1909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {1909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:03,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1910#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:02:03,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1910#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:02:03,171 INFO L290 TraceCheckUtils]: 16: Hoare triple {1910#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1910#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:02:03,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {1910#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1911#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:02:03,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {1911#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1911#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:02:03,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {1911#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1911#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:02:03,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {1911#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1912#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:02:03,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {1912#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1912#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:02:03,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {1912#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {1912#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:02:03,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {1912#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:02:03,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {1913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:02:03,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {1913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {1913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:02:03,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {1913#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1914#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:02:03,181 INFO L290 TraceCheckUtils]: 27: Hoare triple {1914#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1914#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:02:03,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {1914#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {1914#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:02:03,182 INFO L290 TraceCheckUtils]: 29: Hoare triple {1914#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1915#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {1915#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1915#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {1915#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 33: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 43: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 44: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 45: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 56: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 57: Hoare triple {1903#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 58: Hoare triple {1903#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 59: Hoare triple {1903#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {1903#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L272 TraceCheckUtils]: 61: Hoare triple {1903#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {1903#false} ~cond := #in~cond; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 63: Hoare triple {1903#false} assume 0 == ~cond; {1903#false} is VALID [2022-04-27 11:02:03,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {1903#false} assume !false; {1903#false} is VALID [2022-04-27 11:02:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 251 proven. 100 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:02:03,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:02:03,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749151627] [2022-04-27 11:02:03,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749151627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:02:03,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106908846] [2022-04-27 11:02:03,186 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:02:03,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:03,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:02:03,187 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:02:03,189 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:02:03,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:02:03,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:02:03,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 11:02:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:03,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:02:03,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1902#true} call ULTIMATE.init(); {1902#true} is VALID [2022-04-27 11:02:03,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#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); {1902#true} is VALID [2022-04-27 11:02:03,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-27 11:02:03,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#true} {1902#true} #41#return; {1902#true} is VALID [2022-04-27 11:02:03,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#true} call #t~ret6 := main(); {1902#true} is VALID [2022-04-27 11:02:03,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {1935#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {1935#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {1935#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {1935#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:03,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {1935#(= 5000000 main_~z~0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2014#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {2014#(= 5000000 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2014#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,619 INFO L290 TraceCheckUtils]: 33: Hoare triple {2014#(= 5000000 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2014#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {2014#(= 5000000 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2024#(= 4999999 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {2024#(= 4999999 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2024#(= 4999999 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {2024#(= 4999999 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2024#(= 4999999 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {2024#(= 4999999 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2034#(= 4999999 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:03,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {2034#(= 4999999 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2034#(= 4999999 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:03,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {2034#(= 4999999 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2034#(= 4999999 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:03,623 INFO L290 TraceCheckUtils]: 40: Hoare triple {2034#(= 4999999 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2044#(= 4999997 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,623 INFO L290 TraceCheckUtils]: 41: Hoare triple {2044#(= 4999997 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2044#(= 4999997 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {2044#(= 4999997 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2044#(= 4999997 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {2044#(= 4999997 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2054#(= (+ main_~z~0 2) 4999997)} is VALID [2022-04-27 11:02:03,624 INFO L290 TraceCheckUtils]: 44: Hoare triple {2054#(= (+ main_~z~0 2) 4999997)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2054#(= (+ main_~z~0 2) 4999997)} is VALID [2022-04-27 11:02:03,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {2054#(= (+ main_~z~0 2) 4999997)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2054#(= (+ main_~z~0 2) 4999997)} is VALID [2022-04-27 11:02:03,625 INFO L290 TraceCheckUtils]: 46: Hoare triple {2054#(= (+ main_~z~0 2) 4999997)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2064#(= 4999995 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {2064#(= 4999995 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2064#(= 4999995 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {2064#(= 4999995 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2064#(= 4999995 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {2064#(= 4999995 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2074#(= 4999995 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:03,626 INFO L290 TraceCheckUtils]: 50: Hoare triple {2074#(= 4999995 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2074#(= 4999995 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:03,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {2074#(= 4999995 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2074#(= 4999995 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:03,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {2074#(= 4999995 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2084#(= 4999995 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:03,627 INFO L290 TraceCheckUtils]: 53: Hoare triple {2084#(= 4999995 (+ main_~z~0 3))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2084#(= 4999995 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:03,627 INFO L290 TraceCheckUtils]: 54: Hoare triple {2084#(= 4999995 (+ main_~z~0 3))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2084#(= 4999995 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:03,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {2084#(= 4999995 (+ main_~z~0 3))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2094#(= 4999992 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {2094#(= 4999992 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2094#(= 4999992 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {2094#(= 4999992 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2094#(= 4999992 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:03,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {2094#(= 4999992 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2104#(= (+ main_~z~0 2) 4999992)} is VALID [2022-04-27 11:02:03,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {2104#(= (+ main_~z~0 2) 4999992)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2104#(= (+ main_~z~0 2) 4999992)} is VALID [2022-04-27 11:02:03,629 INFO L290 TraceCheckUtils]: 60: Hoare triple {2104#(= (+ main_~z~0 2) 4999992)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2104#(= (+ main_~z~0 2) 4999992)} is VALID [2022-04-27 11:02:03,629 INFO L272 TraceCheckUtils]: 61: Hoare triple {2104#(= (+ main_~z~0 2) 4999992)} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:02:03,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {2114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:02:03,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {2118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1903#false} is VALID [2022-04-27 11:02:03,630 INFO L290 TraceCheckUtils]: 64: Hoare triple {1903#false} assume !false; {1903#false} is VALID [2022-04-27 11:02:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 11:02:03,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:02:04,122 INFO L290 TraceCheckUtils]: 64: Hoare triple {1903#false} assume !false; {1903#false} is VALID [2022-04-27 11:02:04,123 INFO L290 TraceCheckUtils]: 63: Hoare triple {2118#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1903#false} is VALID [2022-04-27 11:02:04,123 INFO L290 TraceCheckUtils]: 62: Hoare triple {2114#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2118#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:02:04,124 INFO L272 TraceCheckUtils]: 61: Hoare triple {2134#(not (= (mod main_~z~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2114#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:02:04,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {2134#(not (= (mod main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2134#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:02:04,124 INFO L290 TraceCheckUtils]: 59: Hoare triple {2134#(not (= (mod main_~z~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2134#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:02:04,125 INFO L290 TraceCheckUtils]: 58: Hoare triple {2144#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2134#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:02:04,125 INFO L290 TraceCheckUtils]: 57: Hoare triple {2144#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2144#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:02:04,125 INFO L290 TraceCheckUtils]: 56: Hoare triple {2144#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2144#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:02:04,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {2154#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2144#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:02:04,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {2154#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2154#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:02:04,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {2154#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2154#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:02:04,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {2164#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2154#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:02:04,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {2164#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2164#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:02:04,133 INFO L290 TraceCheckUtils]: 50: Hoare triple {2164#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2164#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:02:04,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {2174#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2164#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:02:04,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {2174#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2174#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,134 INFO L290 TraceCheckUtils]: 47: Hoare triple {2174#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2174#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {2184#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2174#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,135 INFO L290 TraceCheckUtils]: 45: Hoare triple {2184#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2184#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {2184#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2184#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {2194#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2184#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {2194#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2194#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {2194#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2194#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,137 INFO L290 TraceCheckUtils]: 40: Hoare triple {2204#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2194#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {2204#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2204#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:02:04,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {2204#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2204#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:02:04,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {2214#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2204#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:02:04,140 INFO L290 TraceCheckUtils]: 36: Hoare triple {2214#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2214#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {2214#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2214#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {2224#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2214#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:04,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {2224#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2224#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:02:04,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {2224#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2224#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:02:04,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2224#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:02:04,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2234#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:04,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#true} call #t~ret6 := main(); {1902#true} is VALID [2022-04-27 11:02:04,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#true} {1902#true} #41#return; {1902#true} is VALID [2022-04-27 11:02:04,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#true} assume true; {1902#true} is VALID [2022-04-27 11:02:04,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {1902#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); {1902#true} is VALID [2022-04-27 11:02:04,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {1902#true} call ULTIMATE.init(); {1902#true} is VALID [2022-04-27 11:02:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 377 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-27 11:02:04,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106908846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:02:04,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:02:04,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2022-04-27 11:02:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111153338] [2022-04-27 11:02:04,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:02:04,154 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:04,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:02:04,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:04,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:04,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 11:02:04,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:02:04,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 11:02:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 11:02:04,257 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:14,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:14,126 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2022-04-27 11:02:14,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-27 11:02:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:14,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:02:14,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 166 transitions. [2022-04-27 11:02:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 166 transitions. [2022-04-27 11:02:14,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 166 transitions. [2022-04-27 11:02:14,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:14,543 INFO L225 Difference]: With dead ends: 156 [2022-04-27 11:02:14,543 INFO L226 Difference]: Without dead ends: 107 [2022-04-27 11:02:14,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=916, Invalid=3776, Unknown=0, NotChecked=0, Total=4692 [2022-04-27 11:02:14,545 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 450 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:02:14,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 152 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-27 11:02:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-27 11:02:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2022-04-27 11:02:14,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:02:14,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 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:02:14,584 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 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:02:14,585 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 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:02:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:14,587 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2022-04-27 11:02:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-04-27 11:02:14,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:14,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:14,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 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 107 states. [2022-04-27 11:02:14,588 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 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 107 states. [2022-04-27 11:02:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:02:14,590 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2022-04-27 11:02:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-04-27 11:02:14,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:02:14,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:02:14,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:02:14,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:02:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 101 states have internal predecessors, (125), 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:02:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 129 transitions. [2022-04-27 11:02:14,594 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 129 transitions. Word has length 65 [2022-04-27 11:02:14,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:02:14,594 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 129 transitions. [2022-04-27 11:02:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 34 states have internal predecessors, (107), 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:02:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 129 transitions. [2022-04-27 11:02:14,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-27 11:02:14,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:02:14,595 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 22, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:02:14,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 11:02:14,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:14,812 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:02:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:02:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash 600550285, now seen corresponding path program 5 times [2022-04-27 11:02:14,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:02:14,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122089278] [2022-04-27 11:02:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:02:14,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:02:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:02:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:15,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {2988#(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); {2973#true} is VALID [2022-04-27 11:02:15,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {2973#true} assume true; {2973#true} is VALID [2022-04-27 11:02:15,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2973#true} {2973#true} #41#return; {2973#true} is VALID [2022-04-27 11:02:15,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2973#true} call ULTIMATE.init(); {2988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:02:15,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {2988#(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); {2973#true} is VALID [2022-04-27 11:02:15,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {2973#true} assume true; {2973#true} is VALID [2022-04-27 11:02:15,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2973#true} {2973#true} #41#return; {2973#true} is VALID [2022-04-27 11:02:15,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {2973#true} call #t~ret6 := main(); {2973#true} is VALID [2022-04-27 11:02:15,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {2973#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2978#(= main_~x~0 0)} is VALID [2022-04-27 11:02:15,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2978#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2978#(= main_~x~0 0)} is VALID [2022-04-27 11:02:15,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {2978#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {2978#(= main_~x~0 0)} is VALID [2022-04-27 11:02:15,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {2978#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2979#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:15,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {2979#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2979#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:15,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {2979#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {2979#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:02:15,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {2979#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2980#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:15,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {2980#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2980#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:15,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {2980#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {2980#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:02:15,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {2980#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2981#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:02:15,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {2981#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2981#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:02:15,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {2981#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2981#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:02:15,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {2981#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:02:15,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {2982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:02:15,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {2982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:02:15,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {2982#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2983#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:02:15,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {2983#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2983#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:02:15,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {2983#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {2983#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:02:15,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {2983#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:02:15,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {2984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:02:15,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {2984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {2984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:02:15,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {2984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2985#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:02:15,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {2985#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2985#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:02:15,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {2985#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2985#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:02:15,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {2985#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2986#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:02:15,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {2986#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2986#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:02:15,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {2986#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {2986#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:02:15,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {2986#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2987#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {2987#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2987#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {2987#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 55: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 56: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 59: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 60: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 64: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 65: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 69: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 70: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 71: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 75: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 76: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 77: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 78: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 79: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 80: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 82: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 83: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 94: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 95: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 96: Hoare triple {2974#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {2974#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 98: Hoare triple {2974#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 99: Hoare triple {2974#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L272 TraceCheckUtils]: 100: Hoare triple {2974#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 101: Hoare triple {2974#false} ~cond := #in~cond; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 102: Hoare triple {2974#false} assume 0 == ~cond; {2974#false} is VALID [2022-04-27 11:02:15,105 INFO L290 TraceCheckUtils]: 103: Hoare triple {2974#false} assume !false; {2974#false} is VALID [2022-04-27 11:02:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 628 proven. 126 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-04-27 11:02:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:02:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122089278] [2022-04-27 11:02:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122089278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:02:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969334779] [2022-04-27 11:02:15,106 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:02:15,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:02:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:02:15,107 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:02:15,111 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:02:28,567 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-04-27 11:02:28,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:02:28,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-27 11:02:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:02:28,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:02:29,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {2973#true} call ULTIMATE.init(); {2973#true} is VALID [2022-04-27 11:02:29,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {2973#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); {2973#true} is VALID [2022-04-27 11:02:29,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {2973#true} assume true; {2973#true} is VALID [2022-04-27 11:02:29,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2973#true} {2973#true} #41#return; {2973#true} is VALID [2022-04-27 11:02:29,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {2973#true} call #t~ret6 := main(); {2973#true} is VALID [2022-04-27 11:02:29,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {2973#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {3007#(= 5000000 main_~z~0)} assume !(~x~0 % 4294967296 >= 5000000); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {3007#(= 5000000 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {3007#(= 5000000 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3007#(= 5000000 main_~z~0)} is VALID [2022-04-27 11:02:29,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {3007#(= 5000000 main_~z~0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3095#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {3095#(= 5000000 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3095#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,327 INFO L290 TraceCheckUtils]: 36: Hoare triple {3095#(= 5000000 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3095#(= 5000000 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {3095#(= 5000000 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3105#(= 4999999 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {3105#(= 4999999 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3105#(= 4999999 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {3105#(= 4999999 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3105#(= 4999999 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {3105#(= 4999999 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3115#(= 4999999 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {3115#(= 4999999 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3115#(= 4999999 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {3115#(= 4999999 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3115#(= 4999999 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {3115#(= 4999999 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3125#(= 4999999 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:29,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {3125#(= 4999999 (+ main_~z~0 3))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3125#(= 4999999 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:29,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {3125#(= 4999999 (+ main_~z~0 3))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3125#(= 4999999 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:29,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {3125#(= 4999999 (+ main_~z~0 3))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3135#(= 4999995 main_~z~0)} is VALID [2022-04-27 11:02:29,330 INFO L290 TraceCheckUtils]: 47: Hoare triple {3135#(= 4999995 main_~z~0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3135#(= 4999995 main_~z~0)} is VALID [2022-04-27 11:02:29,330 INFO L290 TraceCheckUtils]: 48: Hoare triple {3135#(= 4999995 main_~z~0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3135#(= 4999995 main_~z~0)} is VALID [2022-04-27 11:02:29,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {3135#(= 4999995 main_~z~0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3145#(= 4999995 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {3145#(= 4999995 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3145#(= 4999995 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,331 INFO L290 TraceCheckUtils]: 51: Hoare triple {3145#(= 4999995 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3145#(= 4999995 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {3145#(= 4999995 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3155#(= 4999995 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {3155#(= 4999995 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3155#(= 4999995 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {3155#(= 4999995 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3155#(= 4999995 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,332 INFO L290 TraceCheckUtils]: 55: Hoare triple {3155#(= 4999995 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3165#(= 4999995 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:29,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {3165#(= 4999995 (+ main_~z~0 3))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3165#(= 4999995 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:29,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {3165#(= 4999995 (+ main_~z~0 3))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3165#(= 4999995 (+ main_~z~0 3))} is VALID [2022-04-27 11:02:29,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {3165#(= 4999995 (+ main_~z~0 3))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3175#(= 4999992 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,334 INFO L290 TraceCheckUtils]: 59: Hoare triple {3175#(= 4999992 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3175#(= 4999992 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {3175#(= 4999992 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3175#(= 4999992 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {3175#(= 4999992 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3185#(= (+ main_~z~0 1) 4999991)} is VALID [2022-04-27 11:02:29,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {3185#(= (+ main_~z~0 1) 4999991)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3185#(= (+ main_~z~0 1) 4999991)} is VALID [2022-04-27 11:02:29,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {3185#(= (+ main_~z~0 1) 4999991)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3185#(= (+ main_~z~0 1) 4999991)} is VALID [2022-04-27 11:02:29,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {3185#(= (+ main_~z~0 1) 4999991)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3195#(= 4999990 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {3195#(= 4999990 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3195#(= 4999990 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {3195#(= 4999990 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3195#(= 4999990 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,336 INFO L290 TraceCheckUtils]: 67: Hoare triple {3195#(= 4999990 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3205#(= 4999990 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,336 INFO L290 TraceCheckUtils]: 68: Hoare triple {3205#(= 4999990 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3205#(= 4999990 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {3205#(= 4999990 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3205#(= 4999990 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {3205#(= 4999990 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3215#(= 4999988 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,338 INFO L290 TraceCheckUtils]: 71: Hoare triple {3215#(= 4999988 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3215#(= 4999988 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {3215#(= 4999988 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3215#(= 4999988 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,338 INFO L290 TraceCheckUtils]: 73: Hoare triple {3215#(= 4999988 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3225#(= (+ main_~z~0 1) 4999987)} is VALID [2022-04-27 11:02:29,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {3225#(= (+ main_~z~0 1) 4999987)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3225#(= (+ main_~z~0 1) 4999987)} is VALID [2022-04-27 11:02:29,339 INFO L290 TraceCheckUtils]: 75: Hoare triple {3225#(= (+ main_~z~0 1) 4999987)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3225#(= (+ main_~z~0 1) 4999987)} is VALID [2022-04-27 11:02:29,339 INFO L290 TraceCheckUtils]: 76: Hoare triple {3225#(= (+ main_~z~0 1) 4999987)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3235#(= 4999986 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,339 INFO L290 TraceCheckUtils]: 77: Hoare triple {3235#(= 4999986 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3235#(= 4999986 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,340 INFO L290 TraceCheckUtils]: 78: Hoare triple {3235#(= 4999986 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3235#(= 4999986 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,353 INFO L290 TraceCheckUtils]: 79: Hoare triple {3235#(= 4999986 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3245#(= (+ main_~z~0 2) 4999986)} is VALID [2022-04-27 11:02:29,353 INFO L290 TraceCheckUtils]: 80: Hoare triple {3245#(= (+ main_~z~0 2) 4999986)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3245#(= (+ main_~z~0 2) 4999986)} is VALID [2022-04-27 11:02:29,353 INFO L290 TraceCheckUtils]: 81: Hoare triple {3245#(= (+ main_~z~0 2) 4999986)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3245#(= (+ main_~z~0 2) 4999986)} is VALID [2022-04-27 11:02:29,354 INFO L290 TraceCheckUtils]: 82: Hoare triple {3245#(= (+ main_~z~0 2) 4999986)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3255#(= 4999984 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,354 INFO L290 TraceCheckUtils]: 83: Hoare triple {3255#(= 4999984 (+ main_~z~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3255#(= 4999984 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,354 INFO L290 TraceCheckUtils]: 84: Hoare triple {3255#(= 4999984 (+ main_~z~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3255#(= 4999984 (+ main_~z~0 1))} is VALID [2022-04-27 11:02:29,354 INFO L290 TraceCheckUtils]: 85: Hoare triple {3255#(= 4999984 (+ main_~z~0 1))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3265#(= 4999984 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,355 INFO L290 TraceCheckUtils]: 86: Hoare triple {3265#(= 4999984 (+ main_~z~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3265#(= 4999984 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,355 INFO L290 TraceCheckUtils]: 87: Hoare triple {3265#(= 4999984 (+ main_~z~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3265#(= 4999984 (+ main_~z~0 2))} is VALID [2022-04-27 11:02:29,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {3265#(= 4999984 (+ main_~z~0 2))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3275#(= (+ main_~z~0 1) 4999982)} is VALID [2022-04-27 11:02:29,356 INFO L290 TraceCheckUtils]: 89: Hoare triple {3275#(= (+ main_~z~0 1) 4999982)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3275#(= (+ main_~z~0 1) 4999982)} is VALID [2022-04-27 11:02:29,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {3275#(= (+ main_~z~0 1) 4999982)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3275#(= (+ main_~z~0 1) 4999982)} is VALID [2022-04-27 11:02:29,356 INFO L290 TraceCheckUtils]: 91: Hoare triple {3275#(= (+ main_~z~0 1) 4999982)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3285#(= (+ main_~z~0 1) 4999981)} is VALID [2022-04-27 11:02:29,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {3285#(= (+ main_~z~0 1) 4999981)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3285#(= (+ main_~z~0 1) 4999981)} is VALID [2022-04-27 11:02:29,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {3285#(= (+ main_~z~0 1) 4999981)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3285#(= (+ main_~z~0 1) 4999981)} is VALID [2022-04-27 11:02:29,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {3285#(= (+ main_~z~0 1) 4999981)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3295#(= (+ main_~z~0 2) 4999981)} is VALID [2022-04-27 11:02:29,357 INFO L290 TraceCheckUtils]: 95: Hoare triple {3295#(= (+ main_~z~0 2) 4999981)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3295#(= (+ main_~z~0 2) 4999981)} is VALID [2022-04-27 11:02:29,358 INFO L290 TraceCheckUtils]: 96: Hoare triple {3295#(= (+ main_~z~0 2) 4999981)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3295#(= (+ main_~z~0 2) 4999981)} is VALID [2022-04-27 11:02:29,358 INFO L290 TraceCheckUtils]: 97: Hoare triple {3295#(= (+ main_~z~0 2) 4999981)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3305#(= (+ main_~z~0 3) 4999981)} is VALID [2022-04-27 11:02:29,358 INFO L290 TraceCheckUtils]: 98: Hoare triple {3305#(= (+ main_~z~0 3) 4999981)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3305#(= (+ main_~z~0 3) 4999981)} is VALID [2022-04-27 11:02:29,359 INFO L290 TraceCheckUtils]: 99: Hoare triple {3305#(= (+ main_~z~0 3) 4999981)} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3305#(= (+ main_~z~0 3) 4999981)} is VALID [2022-04-27 11:02:29,359 INFO L272 TraceCheckUtils]: 100: Hoare triple {3305#(= (+ main_~z~0 3) 4999981)} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {3315#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:02:29,359 INFO L290 TraceCheckUtils]: 101: Hoare triple {3315#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3319#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:02:29,360 INFO L290 TraceCheckUtils]: 102: Hoare triple {3319#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2974#false} is VALID [2022-04-27 11:02:29,360 INFO L290 TraceCheckUtils]: 103: Hoare triple {2974#false} assume !false; {2974#false} is VALID [2022-04-27 11:02:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:02:29,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:02:30,666 INFO L290 TraceCheckUtils]: 103: Hoare triple {2974#false} assume !false; {2974#false} is VALID [2022-04-27 11:02:30,667 INFO L290 TraceCheckUtils]: 102: Hoare triple {3319#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2974#false} is VALID [2022-04-27 11:02:30,667 INFO L290 TraceCheckUtils]: 101: Hoare triple {3315#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3319#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:02:30,668 INFO L272 TraceCheckUtils]: 100: Hoare triple {3335#(not (= (mod main_~z~0 4294967296) 0))} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {3315#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:02:30,668 INFO L290 TraceCheckUtils]: 99: Hoare triple {3335#(not (= (mod main_~z~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {3335#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:02:30,668 INFO L290 TraceCheckUtils]: 98: Hoare triple {3335#(not (= (mod main_~z~0 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3335#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:02:30,669 INFO L290 TraceCheckUtils]: 97: Hoare triple {3345#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3335#(not (= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-27 11:02:30,669 INFO L290 TraceCheckUtils]: 96: Hoare triple {3345#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3345#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:02:30,670 INFO L290 TraceCheckUtils]: 95: Hoare triple {3345#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3345#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:02:30,670 INFO L290 TraceCheckUtils]: 94: Hoare triple {3355#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3345#(not (= (mod (+ main_~z~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 11:02:30,670 INFO L290 TraceCheckUtils]: 93: Hoare triple {3355#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3355#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:02:30,671 INFO L290 TraceCheckUtils]: 92: Hoare triple {3355#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3355#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:02:30,671 INFO L290 TraceCheckUtils]: 91: Hoare triple {3365#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3355#(not (= (mod (+ main_~z~0 4294967294) 4294967296) 0))} is VALID [2022-04-27 11:02:30,672 INFO L290 TraceCheckUtils]: 90: Hoare triple {3365#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3365#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:02:30,672 INFO L290 TraceCheckUtils]: 89: Hoare triple {3365#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3365#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:02:30,672 INFO L290 TraceCheckUtils]: 88: Hoare triple {3375#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3365#(not (= 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-27 11:02:30,673 INFO L290 TraceCheckUtils]: 87: Hoare triple {3375#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3375#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,673 INFO L290 TraceCheckUtils]: 86: Hoare triple {3375#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3375#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,674 INFO L290 TraceCheckUtils]: 85: Hoare triple {3385#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3375#(not (= (mod (+ 4294967292 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,674 INFO L290 TraceCheckUtils]: 84: Hoare triple {3385#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3385#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,674 INFO L290 TraceCheckUtils]: 83: Hoare triple {3385#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3385#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,675 INFO L290 TraceCheckUtils]: 82: Hoare triple {3395#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3385#(not (= (mod (+ 4294967291 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,675 INFO L290 TraceCheckUtils]: 81: Hoare triple {3395#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3395#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,675 INFO L290 TraceCheckUtils]: 80: Hoare triple {3395#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3395#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,676 INFO L290 TraceCheckUtils]: 79: Hoare triple {3405#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3395#(not (= (mod (+ 4294967290 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,676 INFO L290 TraceCheckUtils]: 78: Hoare triple {3405#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3405#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:02:30,676 INFO L290 TraceCheckUtils]: 77: Hoare triple {3405#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3405#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:02:30,677 INFO L290 TraceCheckUtils]: 76: Hoare triple {3415#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3405#(not (= (mod (+ main_~z~0 4294967289) 4294967296) 0))} is VALID [2022-04-27 11:02:30,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {3415#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3415#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {3415#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3415#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {3425#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3415#(not (= (mod (+ 4294967288 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,678 INFO L290 TraceCheckUtils]: 72: Hoare triple {3425#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3425#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:02:30,683 INFO L290 TraceCheckUtils]: 71: Hoare triple {3425#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3425#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:02:30,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {3435#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3425#(not (= (mod (+ main_~z~0 4294967287) 4294967296) 0))} is VALID [2022-04-27 11:02:30,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {3435#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3435#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:30,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {3435#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3435#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:30,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {3445#(not (= (mod (+ main_~z~0 4294967285) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3435#(not (= (mod (+ main_~z~0 4294967286) 4294967296) 0))} is VALID [2022-04-27 11:02:30,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {3445#(not (= (mod (+ main_~z~0 4294967285) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3445#(not (= (mod (+ main_~z~0 4294967285) 4294967296) 0))} is VALID [2022-04-27 11:02:30,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {3445#(not (= (mod (+ main_~z~0 4294967285) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3445#(not (= (mod (+ main_~z~0 4294967285) 4294967296) 0))} is VALID [2022-04-27 11:02:30,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {3455#(not (= (mod (+ main_~z~0 4294967284) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3445#(not (= (mod (+ main_~z~0 4294967285) 4294967296) 0))} is VALID [2022-04-27 11:02:30,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {3455#(not (= (mod (+ main_~z~0 4294967284) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3455#(not (= (mod (+ main_~z~0 4294967284) 4294967296) 0))} is VALID [2022-04-27 11:02:30,686 INFO L290 TraceCheckUtils]: 62: Hoare triple {3455#(not (= (mod (+ main_~z~0 4294967284) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3455#(not (= (mod (+ main_~z~0 4294967284) 4294967296) 0))} is VALID [2022-04-27 11:02:30,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {3465#(not (= (mod (+ 4294967283 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3455#(not (= (mod (+ main_~z~0 4294967284) 4294967296) 0))} is VALID [2022-04-27 11:02:30,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {3465#(not (= (mod (+ 4294967283 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3465#(not (= (mod (+ 4294967283 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {3465#(not (= (mod (+ 4294967283 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3465#(not (= (mod (+ 4294967283 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {3475#(not (= (mod (+ 4294967282 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3465#(not (= (mod (+ 4294967283 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {3475#(not (= (mod (+ 4294967282 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3475#(not (= (mod (+ 4294967282 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {3475#(not (= (mod (+ 4294967282 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3475#(not (= (mod (+ 4294967282 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {3485#(not (= (mod (+ main_~z~0 4294967281) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3475#(not (= (mod (+ 4294967282 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {3485#(not (= (mod (+ main_~z~0 4294967281) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3485#(not (= (mod (+ main_~z~0 4294967281) 4294967296) 0))} is VALID [2022-04-27 11:02:30,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {3485#(not (= (mod (+ main_~z~0 4294967281) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3485#(not (= (mod (+ main_~z~0 4294967281) 4294967296) 0))} is VALID [2022-04-27 11:02:30,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {3495#(not (= (mod (+ main_~z~0 4294967280) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3485#(not (= (mod (+ main_~z~0 4294967281) 4294967296) 0))} is VALID [2022-04-27 11:02:30,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {3495#(not (= (mod (+ main_~z~0 4294967280) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3495#(not (= (mod (+ main_~z~0 4294967280) 4294967296) 0))} is VALID [2022-04-27 11:02:30,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {3495#(not (= (mod (+ main_~z~0 4294967280) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3495#(not (= (mod (+ main_~z~0 4294967280) 4294967296) 0))} is VALID [2022-04-27 11:02:30,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {3505#(not (= (mod (+ main_~z~0 4294967279) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3495#(not (= (mod (+ main_~z~0 4294967280) 4294967296) 0))} is VALID [2022-04-27 11:02:30,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {3505#(not (= (mod (+ main_~z~0 4294967279) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3505#(not (= (mod (+ main_~z~0 4294967279) 4294967296) 0))} is VALID [2022-04-27 11:02:30,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {3505#(not (= (mod (+ main_~z~0 4294967279) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3505#(not (= (mod (+ main_~z~0 4294967279) 4294967296) 0))} is VALID [2022-04-27 11:02:30,695 INFO L290 TraceCheckUtils]: 46: Hoare triple {3515#(not (= (mod (+ main_~z~0 4294967278) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3505#(not (= (mod (+ main_~z~0 4294967279) 4294967296) 0))} is VALID [2022-04-27 11:02:30,695 INFO L290 TraceCheckUtils]: 45: Hoare triple {3515#(not (= (mod (+ main_~z~0 4294967278) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3515#(not (= (mod (+ main_~z~0 4294967278) 4294967296) 0))} is VALID [2022-04-27 11:02:30,695 INFO L290 TraceCheckUtils]: 44: Hoare triple {3515#(not (= (mod (+ main_~z~0 4294967278) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3515#(not (= (mod (+ main_~z~0 4294967278) 4294967296) 0))} is VALID [2022-04-27 11:02:30,696 INFO L290 TraceCheckUtils]: 43: Hoare triple {3525#(not (= (mod (+ main_~z~0 4294967277) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3515#(not (= (mod (+ main_~z~0 4294967278) 4294967296) 0))} is VALID [2022-04-27 11:02:30,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {3525#(not (= (mod (+ main_~z~0 4294967277) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3525#(not (= (mod (+ main_~z~0 4294967277) 4294967296) 0))} is VALID [2022-04-27 11:02:30,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {3525#(not (= (mod (+ main_~z~0 4294967277) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3525#(not (= (mod (+ main_~z~0 4294967277) 4294967296) 0))} is VALID [2022-04-27 11:02:30,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {3535#(not (= (mod (+ 4294967276 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3525#(not (= (mod (+ main_~z~0 4294967277) 4294967296) 0))} is VALID [2022-04-27 11:02:30,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {3535#(not (= (mod (+ 4294967276 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3535#(not (= (mod (+ 4294967276 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,701 INFO L290 TraceCheckUtils]: 38: Hoare triple {3535#(not (= (mod (+ 4294967276 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3535#(not (= (mod (+ 4294967276 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {3545#(not (= (mod (+ 4294967275 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3535#(not (= (mod (+ 4294967276 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,702 INFO L290 TraceCheckUtils]: 36: Hoare triple {3545#(not (= (mod (+ 4294967275 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3545#(not (= (mod (+ 4294967275 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {3545#(not (= (mod (+ 4294967275 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3545#(not (= (mod (+ 4294967275 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {3545#(not (= (mod (+ 4294967275 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,721 INFO L290 TraceCheckUtils]: 10: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !(~x~0 % 4294967296 >= 5000000); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {2973#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3555#(not (= (mod (+ 4294967274 main_~z~0) 4294967296) 0))} is VALID [2022-04-27 11:02:30,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {2973#true} call #t~ret6 := main(); {2973#true} is VALID [2022-04-27 11:02:30,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2973#true} {2973#true} #41#return; {2973#true} is VALID [2022-04-27 11:02:30,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {2973#true} assume true; {2973#true} is VALID [2022-04-27 11:02:30,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {2973#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); {2973#true} is VALID [2022-04-27 11:02:30,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {2973#true} call ULTIMATE.init(); {2973#true} is VALID [2022-04-27 11:02:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-27 11:02:30,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969334779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:02:30,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:02:30,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 27, 27] total 61 [2022-04-27 11:02:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257676764] [2022-04-27 11:02:30,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:02:30,725 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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 104 [2022-04-27 11:02:30,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:02:30,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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:02:30,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:02:30,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-27 11:02:30,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:02:30,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-27 11:02:30,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=3003, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 11:02:30,856 INFO L87 Difference]: Start difference. First operand 106 states and 129 transitions. Second operand has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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:03:36,298 WARN L232 SmtUtils]: Spent 30.08s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:04:38,421 WARN L232 SmtUtils]: Spent 37.59s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:04:41,325 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 11:04:43,830 WARN L833 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967276 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967277) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0))) is different from false [2022-04-27 11:05:21,680 WARN L232 SmtUtils]: Spent 19.67s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:06:06,821 WARN L232 SmtUtils]: Spent 25.89s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:06:59,043 WARN L232 SmtUtils]: Spent 21.41s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:07:07,217 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (not (= 0 (mod (+ 4294967288 c_main_~z~0) 4294967296))) (not (= (mod (+ 4294967293 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967290 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ c_main_~z~0 4294967280) 4294967296) 0)) (not (= (mod (+ 4294967291 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967287 c_main_~z~0) 4294967296) 0)) (not (= (mod c_main_~z~0 4294967296) 0)) (not (= (mod (+ 4294967282 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967295 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967279 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967294 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967285 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967278 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967283 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967281 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967284 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967286 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967292 c_main_~z~0) 4294967296) 0)) (not (= (mod (+ 4294967289 c_main_~z~0) 4294967296) 0)) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-04-27 11:07:10,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:07:55,889 WARN L232 SmtUtils]: Spent 21.14s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:08:22,340 WARN L232 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:08:52,979 WARN L232 SmtUtils]: Spent 16.84s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:09:24,169 WARN L232 SmtUtils]: Spent 14.23s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:09:50,105 WARN L232 SmtUtils]: Spent 13.33s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:10:07,579 WARN L232 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:10:22,807 WARN L232 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:10:36,273 WARN L232 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 11:10:54,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:54,607 INFO L93 Difference]: Finished difference Result 286 states and 382 transitions. [2022-04-27 11:10:54,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-27 11:10:54,608 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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 104 [2022-04-27 11:10:54,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:10:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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:10:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 298 transitions. [2022-04-27 11:10:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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:10:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 298 transitions. [2022-04-27 11:10:54,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 298 transitions. [2022-04-27 11:10:57,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:10:57,330 INFO L225 Difference]: With dead ends: 286 [2022-04-27 11:10:57,330 INFO L226 Difference]: Without dead ends: 188 [2022-04-27 11:10:57,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 476.7s TimeCoverageRelationStatistics Valid=3104, Invalid=11408, Unknown=20, NotChecked=720, Total=15252 [2022-04-27 11:10:57,334 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 1197 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 3891 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 3891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:10:57,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 251 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 3891 Invalid, 0 Unknown, 7 Unchecked, 11.4s Time] [2022-04-27 11:10:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-04-27 11:10:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 183. [2022-04-27 11:10:57,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:10:57,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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:10:57,390 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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:10:57,390 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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:10:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:57,394 INFO L93 Difference]: Finished difference Result 188 states and 237 transitions. [2022-04-27 11:10:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 237 transitions. [2022-04-27 11:10:57,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:57,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:57,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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 188 states. [2022-04-27 11:10:57,395 INFO L87 Difference]: Start difference. First operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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 188 states. [2022-04-27 11:10:57,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:10:57,398 INFO L93 Difference]: Finished difference Result 188 states and 237 transitions. [2022-04-27 11:10:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 237 transitions. [2022-04-27 11:10:57,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:10:57,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:10:57,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:10:57,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:10:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 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:10:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 231 transitions. [2022-04-27 11:10:57,403 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 231 transitions. Word has length 104 [2022-04-27 11:10:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:10:57,403 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 231 transitions. [2022-04-27 11:10:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.9836065573770494) internal successors, (182), 59 states have internal predecessors, (182), 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:10:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 231 transitions. [2022-04-27 11:10:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-27 11:10:57,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:10:57,404 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 25, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:10:57,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:10:57,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:57,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:10:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:10:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1183196667, now seen corresponding path program 6 times [2022-04-27 11:10:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:10:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745477696] [2022-04-27 11:10:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:10:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:10:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:57,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:10:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:57,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {4826#(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); {4810#true} is VALID [2022-04-27 11:10:57,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-04-27 11:10:57,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4810#true} {4810#true} #41#return; {4810#true} is VALID [2022-04-27 11:10:57,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {4810#true} call ULTIMATE.init(); {4826#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:10:57,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {4826#(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); {4810#true} is VALID [2022-04-27 11:10:57,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-04-27 11:10:57,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4810#true} {4810#true} #41#return; {4810#true} is VALID [2022-04-27 11:10:57,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {4810#true} call #t~ret6 := main(); {4810#true} is VALID [2022-04-27 11:10:57,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {4810#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4815#(= main_~x~0 0)} is VALID [2022-04-27 11:10:57,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {4815#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4815#(= main_~x~0 0)} is VALID [2022-04-27 11:10:57,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {4815#(= main_~x~0 0)} assume !(~x~0 % 4294967296 >= 5000000); {4815#(= main_~x~0 0)} is VALID [2022-04-27 11:10:57,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {4815#(= main_~x~0 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4816#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:10:57,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {4816#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4816#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:10:57,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {4816#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !(~x~0 % 4294967296 >= 5000000); {4816#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 11:10:57,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {4816#(and (<= 1 main_~x~0) (<= main_~x~0 1))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4817#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:10:57,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {4817#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4817#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:10:57,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {4817#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 >= 5000000); {4817#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 11:10:57,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {4817#(and (<= 2 main_~x~0) (<= main_~x~0 2))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4818#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:10:57,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {4818#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4818#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:10:57,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {4818#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4818#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 11:10:57,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {4818#(and (<= main_~x~0 3) (<= 3 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4819#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:10:57,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {4819#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4819#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:10:57,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {4819#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4819#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 11:10:57,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {4819#(and (<= main_~x~0 4) (<= 4 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4820#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:10:57,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {4820#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4820#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:10:57,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {4820#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 >= 5000000); {4820#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 11:10:57,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {4820#(and (<= 5 main_~x~0) (<= main_~x~0 5))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4821#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:10:57,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {4821#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4821#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:10:57,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {4821#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 >= 5000000); {4821#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 11:10:57,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {4821#(and (<= 6 main_~x~0) (<= main_~x~0 6))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4822#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:10:57,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {4822#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4822#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:10:57,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {4822#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4822#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 11:10:57,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {4822#(and (<= main_~x~0 7) (<= 7 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4823#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:10:57,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {4823#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4823#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:10:57,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {4823#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4823#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 11:10:57,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {4823#(and (<= main_~x~0 8) (<= 8 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4824#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:10:57,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {4824#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4824#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:10:57,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {4824#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 >= 5000000); {4824#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 11:10:57,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {4824#(and (<= main_~x~0 9) (<= 9 main_~x~0))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4825#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:10:57,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {4825#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4825#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {4825#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 47: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 48: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 49: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 51: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 56: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 57: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 58: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 59: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 60: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 61: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 62: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 63: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 64: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 65: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 67: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 69: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 71: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 72: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 73: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 74: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 75: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 76: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 79: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 80: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 81: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,881 INFO L290 TraceCheckUtils]: 85: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 86: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 87: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 88: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 89: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 90: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 91: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 92: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 93: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 94: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 95: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 96: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 97: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 98: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 99: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 100: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 101: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,882 INFO L290 TraceCheckUtils]: 102: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 103: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 104: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 105: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 106: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 107: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {4811#false} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 111: Hoare triple {4811#false} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 112: Hoare triple {4811#false} assume !(~x~0 % 4294967296 >= 5000000); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 113: Hoare triple {4811#false} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 114: Hoare triple {4811#false} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L272 TraceCheckUtils]: 115: Hoare triple {4811#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 116: Hoare triple {4811#false} ~cond := #in~cond; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 117: Hoare triple {4811#false} assume 0 == ~cond; {4811#false} is VALID [2022-04-27 11:10:57,883 INFO L290 TraceCheckUtils]: 118: Hoare triple {4811#false} assume !false; {4811#false} is VALID [2022-04-27 11:10:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 821 proven. 155 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2022-04-27 11:10:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:10:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745477696] [2022-04-27 11:10:57,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745477696] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:10:57,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476263975] [2022-04-27 11:10:57,885 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:10:57,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:10:57,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:10:57,885 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:10:57,886 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:10:57,959 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-27 11:10:57,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:10:57,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:10:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:10:57,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:10:58,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {4810#true} call ULTIMATE.init(); {4810#true} is VALID [2022-04-27 11:10:58,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {4810#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); {4810#true} is VALID [2022-04-27 11:10:58,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-04-27 11:10:58,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4810#true} {4810#true} #41#return; {4810#true} is VALID [2022-04-27 11:10:58,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {4810#true} call #t~ret6 := main(); {4810#true} is VALID [2022-04-27 11:10:58,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {4810#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,721 INFO L290 TraceCheckUtils]: 22: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,724 INFO L290 TraceCheckUtils]: 33: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,725 INFO L290 TraceCheckUtils]: 36: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,726 INFO L290 TraceCheckUtils]: 39: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,726 INFO L290 TraceCheckUtils]: 41: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4957#(and (= main_~y~0 10000000) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-27 11:10:58,727 INFO L290 TraceCheckUtils]: 43: Hoare triple {4957#(and (= main_~y~0 10000000) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,727 INFO L290 TraceCheckUtils]: 44: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,727 INFO L290 TraceCheckUtils]: 45: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,729 INFO L290 TraceCheckUtils]: 50: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,729 INFO L290 TraceCheckUtils]: 51: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,730 INFO L290 TraceCheckUtils]: 54: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,730 INFO L290 TraceCheckUtils]: 55: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,730 INFO L290 TraceCheckUtils]: 56: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,731 INFO L290 TraceCheckUtils]: 57: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,731 INFO L290 TraceCheckUtils]: 58: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,732 INFO L290 TraceCheckUtils]: 60: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,732 INFO L290 TraceCheckUtils]: 61: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,732 INFO L290 TraceCheckUtils]: 62: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,732 INFO L290 TraceCheckUtils]: 63: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,733 INFO L290 TraceCheckUtils]: 64: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,733 INFO L290 TraceCheckUtils]: 65: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,734 INFO L290 TraceCheckUtils]: 67: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,734 INFO L290 TraceCheckUtils]: 70: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,735 INFO L290 TraceCheckUtils]: 71: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,735 INFO L290 TraceCheckUtils]: 72: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,735 INFO L290 TraceCheckUtils]: 73: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,736 INFO L290 TraceCheckUtils]: 74: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,736 INFO L290 TraceCheckUtils]: 75: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,736 INFO L290 TraceCheckUtils]: 76: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,736 INFO L290 TraceCheckUtils]: 77: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,737 INFO L290 TraceCheckUtils]: 78: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,737 INFO L290 TraceCheckUtils]: 79: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,737 INFO L290 TraceCheckUtils]: 80: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,737 INFO L290 TraceCheckUtils]: 81: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,738 INFO L290 TraceCheckUtils]: 82: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,738 INFO L290 TraceCheckUtils]: 83: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,738 INFO L290 TraceCheckUtils]: 84: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,740 INFO L290 TraceCheckUtils]: 89: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,740 INFO L290 TraceCheckUtils]: 90: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,740 INFO L290 TraceCheckUtils]: 91: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,740 INFO L290 TraceCheckUtils]: 92: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,741 INFO L290 TraceCheckUtils]: 93: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,741 INFO L290 TraceCheckUtils]: 94: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,741 INFO L290 TraceCheckUtils]: 95: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,742 INFO L290 TraceCheckUtils]: 96: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,742 INFO L290 TraceCheckUtils]: 97: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,742 INFO L290 TraceCheckUtils]: 98: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,742 INFO L290 TraceCheckUtils]: 99: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,743 INFO L290 TraceCheckUtils]: 100: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,743 INFO L290 TraceCheckUtils]: 101: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,743 INFO L290 TraceCheckUtils]: 102: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,744 INFO L290 TraceCheckUtils]: 103: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,744 INFO L290 TraceCheckUtils]: 104: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,744 INFO L290 TraceCheckUtils]: 105: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,744 INFO L290 TraceCheckUtils]: 106: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,745 INFO L290 TraceCheckUtils]: 107: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,745 INFO L290 TraceCheckUtils]: 108: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,745 INFO L290 TraceCheckUtils]: 109: Hoare triple {4845#(= main_~y~0 10000000)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,745 INFO L290 TraceCheckUtils]: 110: Hoare triple {4845#(= main_~y~0 10000000)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,746 INFO L290 TraceCheckUtils]: 111: Hoare triple {4845#(= main_~y~0 10000000)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4845#(= main_~y~0 10000000)} is VALID [2022-04-27 11:10:58,746 INFO L290 TraceCheckUtils]: 112: Hoare triple {4845#(= main_~y~0 10000000)} assume !(~x~0 % 4294967296 >= 5000000); {5168#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:10:58,748 INFO L290 TraceCheckUtils]: 113: Hoare triple {5168#(and (= main_~y~0 10000000) (not (<= 5000000 (mod main_~x~0 4294967296))))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5172#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-27 11:10:58,749 INFO L290 TraceCheckUtils]: 114: Hoare triple {5172#(and (= main_~y~0 10000000) (not (<= 5000000 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:10:58,749 INFO L272 TraceCheckUtils]: 115: Hoare triple {4811#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {4811#false} is VALID [2022-04-27 11:10:58,749 INFO L290 TraceCheckUtils]: 116: Hoare triple {4811#false} ~cond := #in~cond; {4811#false} is VALID [2022-04-27 11:10:58,749 INFO L290 TraceCheckUtils]: 117: Hoare triple {4811#false} assume 0 == ~cond; {4811#false} is VALID [2022-04-27 11:10:58,749 INFO L290 TraceCheckUtils]: 118: Hoare triple {4811#false} assume !false; {4811#false} is VALID [2022-04-27 11:10:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 83 proven. 23 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2022-04-27 11:10:58,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:11:00,085 INFO L290 TraceCheckUtils]: 118: Hoare triple {4811#false} assume !false; {4811#false} is VALID [2022-04-27 11:11:00,085 INFO L290 TraceCheckUtils]: 117: Hoare triple {4811#false} assume 0 == ~cond; {4811#false} is VALID [2022-04-27 11:11:00,085 INFO L290 TraceCheckUtils]: 116: Hoare triple {4811#false} ~cond := #in~cond; {4811#false} is VALID [2022-04-27 11:11:00,085 INFO L272 TraceCheckUtils]: 115: Hoare triple {4811#false} call __VERIFIER_assert((if 0 != ~z~0 % 4294967296 then 1 else 0)); {4811#false} is VALID [2022-04-27 11:11:00,086 INFO L290 TraceCheckUtils]: 114: Hoare triple {5200#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {4811#false} is VALID [2022-04-27 11:11:00,086 INFO L290 TraceCheckUtils]: 113: Hoare triple {5204#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5200#(< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:00,087 INFO L290 TraceCheckUtils]: 112: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !(~x~0 % 4294967296 >= 5000000); {5204#(< (mod (+ main_~x~0 1) 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-27 11:11:00,087 INFO L290 TraceCheckUtils]: 111: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,088 INFO L290 TraceCheckUtils]: 110: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,088 INFO L290 TraceCheckUtils]: 109: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,088 INFO L290 TraceCheckUtils]: 108: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,089 INFO L290 TraceCheckUtils]: 107: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,089 INFO L290 TraceCheckUtils]: 106: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,089 INFO L290 TraceCheckUtils]: 105: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,093 INFO L290 TraceCheckUtils]: 104: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,094 INFO L290 TraceCheckUtils]: 103: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,094 INFO L290 TraceCheckUtils]: 102: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,094 INFO L290 TraceCheckUtils]: 101: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,095 INFO L290 TraceCheckUtils]: 100: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,095 INFO L290 TraceCheckUtils]: 99: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,095 INFO L290 TraceCheckUtils]: 98: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,096 INFO L290 TraceCheckUtils]: 97: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,096 INFO L290 TraceCheckUtils]: 95: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,097 INFO L290 TraceCheckUtils]: 94: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,097 INFO L290 TraceCheckUtils]: 93: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,097 INFO L290 TraceCheckUtils]: 92: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,098 INFO L290 TraceCheckUtils]: 91: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,098 INFO L290 TraceCheckUtils]: 90: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,098 INFO L290 TraceCheckUtils]: 89: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,098 INFO L290 TraceCheckUtils]: 88: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,099 INFO L290 TraceCheckUtils]: 87: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,099 INFO L290 TraceCheckUtils]: 86: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,100 INFO L290 TraceCheckUtils]: 82: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,102 INFO L290 TraceCheckUtils]: 78: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,102 INFO L290 TraceCheckUtils]: 77: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,102 INFO L290 TraceCheckUtils]: 76: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,103 INFO L290 TraceCheckUtils]: 75: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,103 INFO L290 TraceCheckUtils]: 74: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,103 INFO L290 TraceCheckUtils]: 73: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,103 INFO L290 TraceCheckUtils]: 72: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,104 INFO L290 TraceCheckUtils]: 69: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,105 INFO L290 TraceCheckUtils]: 66: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,106 INFO L290 TraceCheckUtils]: 65: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,106 INFO L290 TraceCheckUtils]: 64: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,106 INFO L290 TraceCheckUtils]: 63: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,109 INFO L290 TraceCheckUtils]: 53: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,110 INFO L290 TraceCheckUtils]: 52: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,113 INFO L290 TraceCheckUtils]: 45: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {5416#(or (<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0) (not (<= 5000000 (mod main_~x~0 4294967296))))} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {5208#(<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0)} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {5416#(or (<= (div (+ (mod main_~y~0 4294967296) (- 5000001)) (- 4294967296)) 0) (not (<= 5000000 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {4810#true} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {4810#true} assume ~x~0 % 4294967296 >= 5000000;#t~post4 := ~z~0;~z~0 := #t~post4 - 1;havoc #t~post4; {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 24: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {4810#true} #t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {4810#true} assume !(~x~0 % 4294967296 >= 5000000); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {4810#true} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {4810#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {4810#true} call #t~ret6 := main(); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4810#true} {4810#true} #41#return; {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {4810#true} assume true; {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {4810#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); {4810#true} is VALID [2022-04-27 11:11:00,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {4810#true} call ULTIMATE.init(); {4810#true} is VALID [2022-04-27 11:11:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 911 proven. 46 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2022-04-27 11:11:00,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476263975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:11:00,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:11:00,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 6, 6] total 22 [2022-04-27 11:11:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937038327] [2022-04-27 11:11:00,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:11:00,119 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 21 states have internal predecessors, (67), 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 119